An automata-theoretic characterization of the Chomsky-hierarchy

DOI10.1007/978-3-642-13562-0_33MaRDI QIDQ3569090zbMATH OpenOpenAlexFDO

Authors Benedek Nagy

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13562-0_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets
• Finite automata with multiset memory: a new characterization of Chomsky hierarchy
• A note on limited pushdown alphabets in stateless deterministic pushdown automata
• scientific article; zbMATH DE number 1330031
• On the recognizing power of non-expansive go-through automata

Cited in

(11)

• scientific article; zbMATH DE number 5155118 (Why is no real title available?)
• Reflection in the Chomsky hierarchy
• Implementation and Application of Automata
• Chomskian hierarchies of families of sets of piecewise continuous functions
• Finite automata with multiset memory: a new characterization of Chomsky hierarchy
• On the recognizing power of non-expansive go-through automata
• A note on limited pushdown alphabets in stateless deterministic pushdown automata
• An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets
• The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy
• scientific article; zbMATH DE number 2040896 (Why is no real title available?)
• A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets

This page was built for publication: An automata-theoretic characterization of the Chomsky-hierarchy

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