Slender 0L languages

DOI10.1016/0304-3975(95)00067-4zbMath0871.68115OpenAlexW2006086486MaRDI QIDQ1351458

Taishin Y. Nishida, Arto Salomaa

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00067-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ 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 ⋮ A decision method for Parikh slenderness of context-free languages ⋮ On Parikh slender context-free languages ⋮ On lengths of words in context-free languages ⋮ On slender 0L languages ⋮ A characterization of poly-slender context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-deterministic 0L systems and their representation
• Language-theoretic problems arising from Richelieu cryptosystems
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
• Closure properties of slender languages
• On a conjecture about slender context-free languages
• Length considerations in context-free languages
• Description of developmental languages using recurrence systems
• Quasi-deterministic 0L systems