Language-theoretic complexity of disjunctive sequences

DOI10.1016/S0166-218X(97)00061-9zbMATH Open0894.68091OpenAlexW2005414426MaRDI QIDQ1382276FDOQ1382276

Authors: Cristian S. Calude, Sheng Yu 

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

Recommendations

• Mathematical Foundations of Computer Science 2004
• How large is the set of disjunctive sequences?
• scientific article; zbMATH DE number 1665456
• Generalisations of disjunctive sequences
• Disjunctive languages and compatible orders

zbMATH Keywords

disjunctive sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Most numbers obey no probability laws
• Title not available (Why is that?)
• On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theories of computational complexity
• On a conjecture about slender context-free languages
• Length considerations in context-free languages
• Thin and slender languages
• Language-theoretic problems arising from Richelieu cryptosystems
• Characterizing regular languages with polynomial densities
• Title not available (Why is that?)

Cited In (7)

• Abstract fairness and semantics
• Onn-power prefix languages
• A note on autodense related languages
• On lengths of words in context-free languages
• The disjunctivities of \(\omega\)-languages.
• Mathematical Foundations of Computer Science 2004
• On strongly context-free languages

This page was built for publication: Language-theoretic complexity of disjunctive sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382276)