Kernels of sub-classes of context-free languages
From MaRDI portal
Recommendations
Cites work
- Bounded Algol-Like Languages
- Degree-languages: A new concept of acceptance
- Finite turns and the regular closure of linear context-free languages
- Finite-Turn Pushdown Automata
- scientific article; zbMATH DE number 3426894 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1948516 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Nondeterminism and Boolean operations in pda's
- On Context-Free Languages
- On strongly context-free languages
- Regular Closure of Deterministic Languages
- State complexity of some operations on binary regular languages
- The Boolean closure of linear context-free languages
- The Unsolvability of the Recognition of Linear Context-Free Languages
Cited in
(6)- Boolean kernels of context-free languages
- On operations over language families
- Factor and Subsequence Kernels and Signatures of Rational Languages
- scientific article; zbMATH DE number 3926271 (Why is no real title available?)
- scientific article; zbMATH DE number 4011962 (Why is no real title available?)
- Kernels of context-free languages
This page was built for publication: Kernels of sub-classes of context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297763)