Bounded monotone recursion and multihead automata

DOI10.1134/S0361768813060054MaRDI QIDQ2017762zbMATHFDO

Authors S. 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)

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

Cites work

• scientific article; zbMATH DE number 3140026 (Why is no real title available?)
• scientific article; zbMATH DE number 3140027 (Why is no real title available?)
• scientific article; zbMATH DE number 176199 (Why is no real title available?)
• scientific article; zbMATH DE number 1390027 (Why is no real title available?)
• scientific article; zbMATH DE number 3300602 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• CRN elimination and substitution bases for complexity classes
• Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
• Exponential extension of a class of elementary Skolem functions and bounded superpositions of simple arithmetic functions
• Theory of Formal Systems. (AM-47)

Cited in

(7)

• Multi-type recursive functions
• On the operations of bounded suffix summation and multiplication
• Complexity of the search for the least solution to a system of dictionary equations of exponential type
• On elementary word functions obtained by bounded prefix concatenation
• scientific article; zbMATH DE number 3917720 (Why is no real title available?)
• Boolean monadic recursive schemes as a logical characterization of the subsequential functions
• Computations on counter machines with summator

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)