View in EDS HTML Full Text PDF Full Text

Non-perturbative graph languages, halting problem and complexity.

Saved in:

Bibliographic Details
Title:	Non-perturbative graph languages, halting problem and complexity.
Authors:	Shojaei-Fard, Ali¹ (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.

Description
ISSN:	09337741
DOI:	10.1515/forum-2021-0119