A characterization of poly-slender context-free languages
From MaRDI portal
DOI10.1051/ITA:2000100zbMATH Open0966.68097OpenAlexW2025440801MaRDI QIDQ4494483FDOQ4494483
Authors: Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa 
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
Recommendations
- ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- scientific article; zbMATH DE number 2186402
- scientific article; zbMATH DE number 1870552
- A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages
Cites Work
- Bounded Algol-Like Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numeration systems, linear recurrences, and regular sets
- Decision problems concerning thinness and slenderness of formal languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Slender 0L languages
- On a conjecture about slender context-free languages
- Length considerations in context-free languages
- Thin and slender languages
- On Parikh slender languages and power series
- Title not available (Why is that?)
- Language-theoretic problems arising from Richelieu cryptosystems
- On lengths of words in context-free languages
- Semi-discrete context-free languages†
- H-bounded and semi-discrete languages
Cited In (20)
- Title not available (Why is that?)
- On universally easy classes for NP-complete problems.
- On the separability of sparse context-free languages and of bounded rational relations
- Title not available (Why is that?)
- Periodic and Sturmian languages
- Title not available (Why is that?)
- Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages
- Recognition of poly-slender context-free languages by trellis automata
- Dead ends and rationality of complete growth series
- ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES
- A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages
- On the structure of the counting function of sparse context-free languages.
- On the Commutative Equivalence of Algebraic Formal Series and Languages
- Finding the growth rate of a regular or context-free language in polynomial time
- On the commutative equivalence of bounded context-free and regular languages: the code case
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- A sharpening of the Parikh mapping
- On bounded linear codes and the commutative equivalence
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Slender Siromoney matrix languages
Uses Software
This page was built for publication: A characterization of poly-slender context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494483)
