Closure properties of slender languages

DOI10.1016/0304-3975(93)90293-3zbMath0801.68106OpenAlexW2013731921MaRDI QIDQ1314376

Arto Salomaa, Gheorghe Păun

Publication date: 29 November 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90293-3

zbMATH Keywords

closure propertiesChomsky hierarchyslender languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

RESULTS CONCERNING THINNESS OF D0L LANGUAGES ⋮ On a conjecture about slender context-free languages ⋮ A New Operator over Parikh Languages ⋮ Slender 0L languages ⋮ Numeration systems, linear recurrences, and regular sets ⋮ Length considerations in context-free 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 ⋮ On the multiplicity equivalence problem for context-free grammars ⋮ A decision method for Parikh slenderness of context-free languages ⋮ On Parikh slender context-free languages ⋮ On lengths of words in context-free languages

Cites Work

• Language-theoretic problems arising from Richelieu cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Closure properties of slender languages