The missing case in Chomsky-Schützenberger theorem

DOI10.1007/978-3-319-30000-9_27MaRDI QIDQ2798732zbMATH OpenOpenAlexFDO

Authors Stefano Crespi Reghizzi, Pierluigi San Pietro

Publication date 13 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30000-9_27

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
• Non-erasing Variants of the Chomsky–Schützenberger Theorem
• On the Chomsky and Stanley's homomorphic characterization of context-free languages
• Morphic characterizations with insertion systems controlled by a context of length one
• Chomsky-Schützenberger-type characterization of multiple context-free languages

Cited in

(4)

• Hardest languages for conjunctive and Boolean grammars
• Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
• Non-erasing Variants of the Chomsky–Schützenberger Theorem
• Limited automata and unary languages

This page was built for publication: The missing case in Chomsky-Schützenberger theorem

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