Non-perturbative graph languages, halting problem and complexity.
Saved in:
| Title: | Non-perturbative graph languages, halting problem and complexity. |
|---|---|
| Authors: | Shojaei-Fard, Ali1 (AUTHOR) shojaeifa@yahoo.com |
| Source: | Forum Mathematicum. Sep2022, Vol. 34 Issue 5, p1159-1185. 27p. |
| Database: | Mathematics Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 158777537 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Non-perturbative graph languages, halting problem and complexity. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Shojaei-Fard%2C+Ali%22">Shojaei-Fard, Ali</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> shojaeifa@yahoo.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Forum+Mathematicum%22">Forum Mathematicum</searchLink>. Sep2022, Vol. 34 Issue 5, p1159-1185. 27p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=158777537 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1515/forum-2021-0119 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 27 StartPage: 1159 Titles: – TitleFull: Non-perturbative graph languages, halting problem and complexity. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Shojaei-Fard, Ali IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2022 Type: published Y: 2022 Identifiers: – Type: issn-print Value: 09337741 Numbering: – Type: volume Value: 34 – Type: issue Value: 5 Titles: – TitleFull: Forum Mathematicum Type: main |
| ResultId | 1 |