A decision method for Parikh slenderness of context-free languages
From MaRDI portal
Publication:674912
DOI10.1016/S0166-218X(96)00023-6zbMath0865.68072MaRDI QIDQ674912
Publication date: 30 June 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (6)
On bounded linear codes and the commutative equivalence ⋮ On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ On Parikh slender context-free languages ⋮ The Parikh counting functions of sparse context-free languages are quasi-polynomials ⋮ On lengths of words in context-free languages ⋮ Min of Mat is not necessarily Mat
Cites Work
- 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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A decision method for Parikh slenderness of context-free languages
