On Parikh slender context-free languages
From MaRDI portal
Publication:5941095
DOI10.1016/S0304-3975(00)00393-5zbMath0974.68098MaRDI QIDQ5941095
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On bounded linear codes and the commutative equivalence ⋮ On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ On the structure of the counting function of sparse context-free languages. ⋮ The Parikh counting functions of sparse context-free languages are quasi-polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A decision method for Parikh slenderness of context-free languages
- Language-theoretic problems arising from Richelieu cryptosystems
- Analytic models and ambiguity of context-free languages
- Prefixes of infinite words and ambiguous context-free languages
- Closure properties of slender languages
- Numeration systems, linear recurrences, and regular sets
- On a conjecture about slender context-free languages
- Slender 0L languages
- Length considerations in context-free languages
- Thin and slender languages
- On Parikh slender languages and power series
- Bounded Algol-Like Languages