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

DOI10.1016/S1571-0661(05)82579-4zbMath1263.68099MaRDI QIDQ4923560

Carlos Martín-Vide, Victor Mitrana, Masami Ito

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Language-theoretic problems arising from Richelieu cryptosystems
• Analytic models and ambiguity of context-free languages
• Prefixes of infinite words and ambiguous context-free languages
• Rational bijection of rational sets
• Decision problems concerning thinness and slenderness of formal 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
• A characterization of poly-slender context-free languages