Language-theoretic complexity of disjunctive sequences
From MaRDI portal
Publication:1382276
DOI10.1016/S0166-218X(97)00061-9zbMath0894.68091OpenAlexW2005414426MaRDI QIDQ1382276
Publication date: 25 March 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (6)
Abstract fairness and semantics ⋮ Onn-power prefix languages ⋮ A note on autodense related languages ⋮ The disjunctivities of \(\omega\)-languages. ⋮ On strongly context-free languages ⋮ On lengths of words in context-free languages
Cites Work
- Language-theoretic problems arising from Richelieu cryptosystems
- Theories of computational complexity
- On a conjecture about slender context-free languages
- Length considerations in context-free languages
- Thin and slender languages
- Characterizing regular languages with polynomial densities
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Language-theoretic complexity of disjunctive sequences
