Language-theoretic complexity of disjunctive sequences

Discrete Applied Mathematics

Volumn 80, Issue 2-3, 1997, Pages 203-209

  Calude, Cristian ^a   Yu, Sheng ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348104741     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00061-9     Document Type: Article

References (15)

1. M. Andraşiu, G. Pǎun, J. Dassow and A. Salomaa, Language-theoretic problems arising from Richelieu cryptosystems, Theoret. Comput. Sci. 116 (1993) 339-357.
2. C. Calude, Theories of Computational Complexity (North-Holland, Amsterdam, 1988).
3. C. Calude, Borel normality and algorithmic randomness, in: G. Rozenberg and A. Salomaa, eds., Developments in Language Theory (World Scientific, Singapore, 1994) 113-129.
4. C. Calude, Information and Randomness: An Algorithmic Perspective (Springer, Berlin, 1994).
5. C. Calude and T. Zamfirescu, Most numbers obey no probability laws, Tech. Rept. No. 112, Dept. of Computer Science, The University of Auckland, New Zealand, 1995.
6. G.J. Chaitin, On the simplicity and speed of programs for computing infinite sets of natural numbers, J. ACM 16 (1969) 407-422.
7. G.J. Chaitin, Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory (World Scientific, Singapore, 2nd ed., 1990).
8. P. Hertling, Disjunctive ω-words and real numbers, Manuscript, Fernuniversität Hagen, 1994.
9. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
10. L. Ilie, On a conjecture about slender context-free languages, Theoret. Comput. Sci. 132 (1994) 427-434.
11. H. Jürgensen and G. Thierrin, Some structural properties of ω-languages, in: 13th Nat. School with Internat. Participation "Applications of Mathematics in Technology", Sofia (1988) 56-63.
12. S. Marcus and Gh. Pǎun, Infinite (almost periodic) words, formal languages and dynamical systems, Bull. EATCS 54 (1994) 224-231.
13. Gh. Pǎun and A. Salomaa, Thin and slender languages, Discrete Appl. Math. 61 (1995) 257-270.
14. A. Szilard, S. Yu, K. Zhang and J. Shallit, Characterizing regular languages with polynomial densities, in: Proc. 17th Internat. Symp. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 629 (Springer, Berlin, 1992) 494-503.
15. D. Raz, Length considerations in context-free languages, Theoret. Comput. Sci. 183 (1997), to appear.