Gaining Power by Input Operations: Finite Automata and Beyond

DOI10.1007/978-3-642-22256-6_3MaRDI QIDQ5200048zbMATH OpenOpenAlexFDO

Authors Markus Holzer, Martin Kutrib

Publication date 29 July 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22256-6_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3911710
• On the power of alternation in automata theory
• scientific article; zbMATH DE number 2099333
• On the power of P automata
• On computational power of weighted finite automata
• scientific article; zbMATH DE number 871243
• scientific article; zbMATH DE number 1696661
• The power of symbolic automata and transducers
• scientific article; zbMATH DE number 1834685
• On the computational power of affine automata

Cites work

• A Generalization of Ogden's Lemma
• A geometric hierarchy of languages
• Classes of languages and linear-bounded automata
• Closure and decidability properties of some language classes with respect to ciliate bio-operations.
• Control sets on linear grammars
• Deterministic Input-Reversal and Input-Revolving Finite Automata
• Developments in Language Theory
• Developments in Language Theory
• Families of languages defined by ciliate bio-operations
• Hairpin Finite Automata
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 1337734 (Why is no real title available?)
• scientific article; zbMATH DE number 2038733 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• HYBRID EXTENDED FINITE AUTOMATA
• Indexed Grammars—An Extension of Context-Free Grammars
• Iterated linear control and iterated one-turn pushdowns
• LANGUAGE FAMILIES DEFINED BY A CILIATE BIO-OPERATION: HIERARCHIES AND DECISION PROBLEMS
• Linear indexed languages
• Nested Stack Automata
• On input-revolving deterministic and nondeterministic finite automata
• One way finite visit automata
• One-way stack automata
• Operations and language generating devices suggested by the genome evolution

Cited in

(4)

• HYBRID EXTENDED FINITE AUTOMATA
• Deterministic Input-Reversal and Input-Revolving Finite Automata
• Developments in Language Theory
• Hybrid Extended Finite Automata

This page was built for publication: Gaining Power by Input Operations: Finite Automata and Beyond

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