An infinite hierarchy of intersections of context-free languages

DOI10.1007/BF01762237zbMath0257.68077MaRDI QIDQ5672209

P. Weiner, L. Y. Liu

Publication date: 1973

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item, Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata, Dynamical recognizers: real-time language recognition by analog computers, Extensional Uniformity for Boolean Circuits, The Boolean closure of linear context-free languages, Counter machines and crystallographic structures, Observations about bounded languages and developmental systems, On state-alternating context-free grammars, The descriptive complexity approach to LOGCFL, Degree-languages: A new concept of acceptance, Direct or cascade product of pushdown automata, Nondeterminism and Boolean operations in pda's, On growing context-sensitive languages, Refining nondeterminism in context-free languages, Intersections de langages algébriques bornes, Some restrictions onW-grammars

Uses Software

• ALGOL 60

Cites Work

• Semigroups, Presburger formulas, and languages
• Bounded Algol-Like Languages
• Classes of languages and linear-bounded automata
• Unnamed Item
• Unnamed Item
• Unnamed Item