It is decidable whether a regular language is pure context-free

DOI10.1016/0304-3975(83)90088-9MaRDI QIDQ787679zbMATH OpenOpenAlexFDO

Authors W. Bucher, Johann Hagauer

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90088-9

zbMATH Keywords

regular languagepure context-free language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Cites work

• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3733283 (Why is no real title available?)
• scientific article; zbMATH DE number 3740775 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• On sentential forms of context-free grammars
• Pure grammars
• Pure grammars and pure languages†
• Some decidability problems of sentential formst †

This page was built for publication: It is decidable whether a regular language is pure context-free

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