Some decision problems concerning semilinearity and commutation

Journal of Computer and System Sciences

Volumn 65, Issue 2, 2002, Pages 278-294

  Harju, Tero ^a   Ibarra, Oscar ^b   Karhumäki, Juhani ^a   Salomaa, Arto ^c  

^a UNIVERSITY OF TURKU   (Finland)

^b Santa Barbara   (United States)

^c TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Combinatorics on words; Commutation of languages; Context free languages; Morphisms; Reversal bounded counters

Indexed keywords

ASYNCHRONOUS MACHINERY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA REDUCTION; MATHEMATICAL MODELS; ONLINE SYSTEMS; PROBLEM SOLVING; SET THEORY;

COMBINATORICS ON WORDS; COMMUNICATION OF LANGUAGES; CONTEXT-FREE LANGUAGES; MORPHISMS; REVERSAL-BOUNDED COUNTERS;

PROBLEM SOLVING;

EID: 0842270510     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1836     Document Type: Article

References (21)

1. L. Breveglieri, A. Cherubini, C. Citrini, and S. Crespi Reghizzi, Multiple pushdown languages and grammars, Internat. J. Found Comput. Sci. 7 (1996), 253-291.
2. C. Choffrut and J. Karhumäki, Combinatorics of words, in "Handbook of Formal Languages," (A. Salomaa and G. Rozenberg, Eds.), Vol. 1, pp. 329-438, Springer-Verlag, Berlin, 1997.
3. C. Choffrut and J. Karhumäki, Characterizing the subsets of words commuting with a set of two words, in "Proceedings of the 7th Nordic Combinatorial Conference," T. Harju and T. Honkala, Eds.), Turku, Finland, 1999.
4. C. Choffrut, J. Karhumäki and N. Ollinger, The commutation of finite sets: Challenging problem, Theoret. Comput. Sci. (2001) to appear.
5. K. Culik II and A. Salomaa, On the decidability of homomorphism equivalence for languages, J. Comput. System Sci. 17 (1978), 163-175.
6. Z. Dang, "Verification and Debugging of Infinite State Real-Time Systems," Ph.D. thesis, University of California, Santa Barbara, 2000.
7. S. Ginsburg, "The Mathematical Theory of Context-Free Languages," McGraw-Hill, New York, 1966.
8. S. A. Greibach, Checking automata and one-way stack languages, SDC Document TM 738/045/00, 1968.
9. E. M. Gurari and O. H. Ibarra, The complexity of decision problems for finite-turn multicounter machines, J. Comput. System Sci. 22 (1981), 220-229.
10. V. Halava and T. Harju, Undecidability in integer weighted finite automata. Fundatnenta. Inf. 38 (1999), 189-200.
11. M. Harrison, "Introduction to Formal Language Theory," Addison-Wesley, Reading, MA, 1978.
12. S. Horvath, J. Karhumäki, and H. C. M. Kleijn, Results concerning palindromicity, J. Internat. Process. Cyber. EIK 23 (1987), 441-451.
13. O. H. Ibarra, Reversal-bounded multicounter machines and their decision problems, J. ACM 25 (1978), 116-133.
14. O. H. Ibarra, T. Bultan, and J. Su, Reachability analysis for some models of infinite-state transition systems, in "Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000)," (Catuscia Palamidessi, Ed.), Lecture Notes in Comput. Sci. Vol. 1877, pp. 183-198, Springer-Verlag, Berlin, 2000.
15. O. H. Ibarra, T. Jiang, N. Tran, and H. Wang, New decidability results concerning two-way counter machines, SIAM J. Comput. 24 (1995), 123-137.
16. J. Karhumäki, and L. P. Lisovik, A simple undecidable problem: the inclusion problem for finite substitution on ah* 'c, Inform, and Comput. (2001), to appear.
17. M. Lothaire, "Combinatorics on Words," Addison-Wesley, Reading, MA, 1983.
18. R. Parikh, On context-free languages, J. ACM 13 (1966), 570-581.
19. A. Salomaa, "Formal Languages," Academic Press, New York, 1973.
20. G. Sénizergues, The equivalence problem for deterministic pushdown automata is decidable, Theoret. Comput. Sci. 251 (2001), 1-166.
21. C. Stirling, Decidability of DPDA equivalence, Theoret. Comput. Sci. 225 (2001), 1-31.