On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems

Theoretical Computer Science

Volumn 164, Issue 1-2, 1996, Pages 29-40

  Harrison, John ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; CONTEXT SENSITIVE LANGUAGES; PROBLEM SOLVING;

CYLINDRICAL LANGUAGES; DECIDABILITY; FORMAL LANGUAGE THEORY; PERIODIC D0L LANGUAGES; PRIMITIVE SEQUENCES; PRIMITIVITY;

FORMAL LANGUAGES;

EID: 0030247127     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00168-9     Document Type: Article

References (11)

1. A. Ehrenfeucht and G. Rozenberg, Simplifications of homomorphisms, Inform. and Control 38 (1978) 298-309.
2. W. Forys and T. Head, The posets of retracts of a free monoid, Int. J. Comput. Math. 43 (1992) 127-131.
3. J. Harrison, Dynamical properties of PWD0L systems, Theoret. Comput. Sci. 143 (1995) 269-284.
4. J. Harrison, Morphic congruences and D0L languages, Theoret. Comput. Sci. 134 (1994) 537-544.
5. T. Head, Expanded subalphabets in the theories of languages and semigroups, Int. J. Comput. Math. 12 (1982) 113-123.
6. T. Head and M. Ito, Power absorbing languages and semigroups, submitted.
7. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
8. N. Immerman, Nondeterministic Space is closed under Complementation, SIAM J. Comput. 17 (1988) 935-938.
9. M. Ito, M. Katsura, H.J. Shyr and S.S. Yu, Automata accepting primitive words, Semigroup Forum 37 (1988) 45-52.
10. B. Lando, Periodicity and ultimate periodicity of D0L systems, Theoret. Comput. Sci. 82 (1991) 19-33.
11. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems (Academic Press, New York, 1980).