On sparse languages \(L\) such that \(LL= \Sigma^*\)

DOI10.1016/0166-218X(94)90146-5zbMath0813.68124OpenAlexW1480028229MaRDI QIDQ1331892

Per Enflo, Andrew Granville, Jeffrey O. Shallit, Sheng Yu

Publication date: 27 September 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90146-5

zbMATH Keywords

sparse language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Unambiguous conjunctive grammars over a one-symbol alphabet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über Basen der natürlichen Zahlenreihe
• Can the catenation of two weakly sparse languages be dense?
• Long repetitive patterns in random sequences

This page was built for publication: On sparse languages \(L\) such that \(LL= \Sigma^*\)