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

DOI10.1016/0304-3975(83)90088-9zbMATH Open0529.68042OpenAlexW2086711541MaRDI QIDQ787679FDOQ787679

Johann Hagauer, W. Bucher

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

• Pure grammars
• Pure grammars and pure languages†
• On sentential forms of context-free grammars
• Some decidability problems of sentential formst †
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)