On the complexity of decidable cases of commutation problem for languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2138, Issue , 2001, Pages 193-203

  Karhumäki, Juhani ^a   Plandowski, Wojciech ^b   Rytter, Wojciech ^b,c  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; POLYNOMIAL APPROXIMATION; SET THEORY;

COMMUTATION PROBLEM; DETERMINISTIC AUTOMATA; FINITE LANGUAGES; NONDETERMINISTIC AUTOMATA; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; REGULAR EXPRESSIONS; TIME COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 84974670903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_20     Document Type: Conference Paper

References (18)

1. C. Choffrut, J. Karhumaki, N. Ollinger, The commutation of finite sets: a challenging problem, TUCS Technical Report 303, http://www.tucs.fi/, 1999.
2. J. H. Conway, Regular algebra and finite machines, Chapman Hall, 1971.
3. M. Crochemore, W. Rytter, Text algorithms, Oxford University Press, 1994
4. V. Diekert, Makanin’s algorithm, in Lothaire II, to appear.
5. A. Ehrenfeucht, P. Zeiger, Complexity measures for expressions, J. Comput. System Sci. 12, 134-146, 1976.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: Aguide to the theory of NP-completeness, San Francisco: H.Freeman, 1978.
7. T. Harju, O. Ibarra, J. Karhumäki, A. Salomaa, Decision questions concerning semilinearity, morphisms and commutation of languages, TUCS Technical Report 376, http://www.tucs.fi/, 2000.
8. C. Hagenach, A. Muscholl, Computing ε-free NFAfr om regular expressions in O(n log2 n) time, LNCS 1450, 277-285, 1998.
9. J. Hromkovic, S. Seibert, T. Wilke, Translating regular expressions into small ε-free nondeterministic finite automata, LNCS 1200, 55-66, 1997.
10. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
11. J. Karhumäki, Combinatorial and computational problems on finite sets of words, Proc. MCU2001, LNCS, to appear.
12. J. Karhumäki, I. Petre, On the centralizer of a finite set, Proc. ICALP 2000, LNCS 1853, 536-514, 2000.
13. E. Leiss, Language equations, Springer-Verlag, 1998.
14. M. Lothaire, Combinatorics on words, Addison-Wesley, 1983.
15. G.S. Makanin, The problem of solvability of equations in a free semigroup, Mat. Sb. 103(2), 147-236, in russian; english translation in: Math. USSR Sbornik, 32, 129-198, 1977.
16. W. Plandowski, Satisfiability of word equations with constants is in PSPACE, Proc. FOCS 1999, 1999.
17. B. Ratoandramanana, Codes et motifs, RAIRO Theor. Informat. 23, 425-444, 1989.
18. S. Yu, Regular languages, in G. Rozengerg, A. Salomaa (eds.), Handbook of Formal Languages, Springer, 41-110, 1997.