Unions of certain bounded deterministic languages

DOI10.1080/00207168408803428MaRDI QIDQ3339315zbMATH OpenOpenAlexFDO

Authors Leslie Paul Jones, Jonathan Goldstine

Publication date 1984

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168408803428

zbMATH Keywords

bounded context-free languagebounded deterministic languagesdeterministic pushdown automatalinear sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Union-Free and Deterministic Union-Free Languages
• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
• On the union of 0L languages
• Most complex deterministic union-free regular languages
• Complexity in Union-Free Regular Languages

Cites work

• A characterization theorem for certain bounded deterministic context-free languages
• Ambiguity in context free languages
• Deterministic context free languages
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Mappings of languages by two-tape devices

Cited in

(2)

• On Union-Free and Deterministic Union-Free Languages
• On the union of 0L languages

This page was built for publication: Unions of certain bounded deterministic languages

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