Bounded monotone recursion and multihead automata

DOI10.1134/S0361768813060054zbMath1311.03069MaRDI QIDQ2017762

Sergey S. Marchenkov

Publication date: 23 March 2015

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

bounded monotone recursionmultihead nonerasing automaton

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (3)

On the operations of bounded suffix summation and multiplication ⋮ Computations on counter machines with summator ⋮ Complexity of the search for the least solution to a system of dictionary equations of exponential type

Cites Work

• Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
• CRN Elimination and Substitution Bases for Complexity Classes
• Theory of Formal Systems. (AM-47)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded monotone recursion and multihead automata