RESULTS CONCERNING THINNESS OF D0L LANGUAGES

DOI10.1142/S0218196700000054zbMath1007.68114MaRDI QIDQ4786244

Juha Honkala

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

exponential D0L languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Language-theoretic problems arising from Richelieu cryptosystems
• Decision problems concerning thinness and slenderness of formal languages
• Closure properties of slender languages
• On a conjecture about slender context-free languages
• Slender 0L languages
• Thin and slender languages
• On Parikh slender languages and power series
• Deux propriétés décidables des suites récurrentes linéaires