A characterization of poly-slender context-free languages
From MaRDI portal
Publication:4494483
DOI10.1051/ita:2000100zbMath0966.68097MaRDI QIDQ4494483
Lucian Ilie, Arto Salomaa, Grzegorz Rozenberg
Publication date: 6 February 2001
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222052
Related Items
On the commutative equivalence of bounded context-free and regular languages: the code case, Periodic and Sturmian languages, Slender Siromoney matrix languages, On the separability of sparse context-free languages and of bounded rational relations, The Parikh counting functions of sparse context-free languages are quasi-polynomials, Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508, On universally easy classes for NP-complete problems., On bounded linear codes and the commutative equivalence, Recognition of poly-slender context-free languages by trellis automata, On the structure of the counting function of sparse context-free languages., A sharpening of the Parikh mapping, Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time, FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Language-theoretic problems arising from Richelieu cryptosystems
- Decision problems concerning thinness and slenderness of formal 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
- On lengths of words in context-free languages
- Thin and slender languages
- On Parikh slender languages and power series
- Semi-discrete context-free languages†
- H-bounded and semi-discrete languages
- Bounded Algol-Like Languages