A closure property of deterministic context-free languages

DOI10.1016/0020-0190(81)90067-3MaRDI QIDQ1149789zbMATH OpenOpenAlexFDO

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

Cites work

• scientific article; zbMATH DE number 3653575 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A Note on Pushdown Store Automata and Regular Systems
• A representation of trees by languages. I
• Sur une variante des fonctions séquentielles
• Test sets and checking words for homomorphism equivalence

Cited in

(1)

• An application of the matrix representation of transductions

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

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