A closure property of deterministic context-free languages

DOI10.1016/0020-0190(81)90067-3zbMath0454.68096OpenAlexW2044044594MaRDI QIDQ1149789

Christian Choffrut

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90067-3

zbMATH Keywords

regular languagepushdown automatonrational language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

An application of the matrix representation of transductions

Cites Work

• Test sets and checking words for homomorphism equivalence
• Sur une variante des fonctions séquentielles
• A representation of trees by languages. I
• A Note on Pushdown Store Automata and Regular Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A closure property of deterministic context-free languages