Language-theoretic complexity of disjunctive sequences

DOI10.1016/S0166-218X(97)00061-9MaRDI QIDQ1382276zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

disjunctive sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

• scientific article; zbMATH DE number 44959 (Why is no real title available?)
• scientific article; zbMATH DE number 709541 (Why is no real title available?)
• scientific article; zbMATH DE number 736618 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Characterizing regular languages with polynomial densities
• Language-theoretic problems arising from Richelieu cryptosystems
• Length considerations in context-free languages
• Most numbers obey no probability laws
• On a conjecture about slender context-free languages
• On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
• Theories of computational complexity
• Thin and slender languages

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 -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)