Bounded monotone recursion and multihead automata

DOI10.1134/S0361768813060054zbMATH Open1311.03069MaRDI QIDQ2017762FDOQ2017762

Authors: S. S. Marchenkov 

Publication date: 23 March 2015

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

Recommendations

• On elementary word functions obtained by bounded prefix concatenation
• One-way multihead finite automata and 2-bounded languages
• scientific article; zbMATH DE number 3995650
• Multi-head finite automata: characterizations, concepts and open problems
• Multihead one-way finite automata

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)

Cites Work

• Title not available (Why is that?)
• Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
• Title not available (Why is that?)
• Theory of Formal Systems. (AM-47)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• CRN elimination and substitution bases for complexity classes
• Exponential extension of a class of elementary Skolem functions and bounded superpositions of simple arithmetic functions
• Title not available (Why is that?)

Cited In (4)

• Complexity of the search for the least solution to a system of dictionary equations of exponential type
• Computations on counter machines with summator
• Title not available (Why is that?)
• On the operations of bounded suffix summation and multiplication

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017762)