Decision problems for graph schemata with commutable operators. Part II
- 1 September 1971
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 7 (5) , 778-789
- https://doi.org/10.1007/bf01641495
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Context-Free LanguagesJournal of the ACM, 1966
- The analysis of a transfer graph for an operator schemeUSSR Computational Mathematics and Mathematical Physics, 1965
- On Relations Defined by Generalized Finite AutomataIBM Journal of Research and Development, 1965
- Decision Problems of Phrase-Structure GrammarsIEEE Transactions on Electronic Computers, 1964
- RS -Machines with Almost Blank TapeJournal of the ACM, 1964
- On constructing a prohibition-matrix for an operator scheme with library callsUSSR Computational Mathematics and Mathematical Physics, 1964
- Store economy in closed operator schemesUSSR Computational Mathematics and Mathematical Physics, 1962
- On certain formal properties of grammarsInformation and Control, 1959
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946