Closure properties of slender languages

DOI10.1016/0304-3975(93)90293-3zbMath0801.68106MaRDI 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 properties; Chomsky hierarchy; slender languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

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