An infinite hierarchy of intersections of context-free languages
From MaRDI portal
Cites work
- Bounded Algol-Like Languages
- Classes of languages and linear-bounded automata
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3313290 (Why is no real title available?)
- Semigroups, Presburger formulas, and languages
Cited in
(18)- Dynamical recognizers: real-time language recognition by analog computers
- Degree-languages: A new concept of acceptance
- Direct or cascade product of pushdown automata
- Nondeterminism and Boolean operations in pda's
- Counter machines and crystallographic structures
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
- Extensional Uniformity for Boolean Circuits
- scientific article; zbMATH DE number 3551930 (Why is no real title available?)
- Observations about bounded languages and developmental systems
- Refining nondeterminism in context-free languages
- Some restrictions onW-grammars
- On growing context-sensitive languages
- On state-alternating context-free grammars
- The descriptive complexity approach to LOGCFL
- Dissecting power of intersection of two context-free languages
- Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
- Intersections de langages algébriques bornes
- The Boolean closure of linear context-free languages
This page was built for publication: An infinite hierarchy of intersections of context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672209)
