Abstract
We investigate the complexity of basic decidable cases of the commutation problem for languages: testing the equality XY = YX for two languages X, Y, given different types of representations of X, Y. We concentrate on (the most interesting) case when Y is an explicitly given finite language. This is motivated by a renewed interest and recent progress, see [12,1], in an old open problem posed by Conway [2]. We show that the complexity of the commutation problem varies from co-NEXPTIME-complete, through P-SPACE complete and co-NP complete, to deterministic polynomial time. Classical types of description are considered: nondeterministic automata with and without cycles, regular expressions and grammars. Interestingly, in most cases the complexity status does not change if instead of explicitly given finite Y we consider general Y of the same type as that of X. For the case of commutation of two finite sets we provide polynomial time algorithms whose time complexity beats that of a naive algorithm. For deterministic automata the situation is more complicated since the complexity of concatenation of deterministic automaton language X with a finite set Y is asymmetric: while the minimal dfa’s for XY would be polynomial in terms of dfa’s for X and Y, that for YX can be exponential.
Supported by Academy of Finland under grant 44087.
Supported in part by KBN grant 8T11C03915.
Supported in part by KBN grant 8T11C03915.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Choffrut, J. Karhumaki, N. Ollinger, The commutation of finite sets: a challenging problem, TUCS Technical Report 303, http://www.tucs.fi/, 1999.
J. H. Conway, Regular algebra and finite machines, Chapman Hall, 1971.
M. Crochemore, W. Rytter, Text algorithms, Oxford University Press, 1994
V. Diekert, Makanin’s algorithm, in Lothaire II, to appear.
A. Ehrenfeucht, P. Zeiger, Complexity measures for expressions, J. Comput. System Sci. 12, 134–146, 1976.
M.R. Garey, D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, San Francisco: H.Freeman, 1978.
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.
C. Hagenach, A. Muscholl, Computing ε-free NFA from regular expressions in O(nlog2 n) time, LNCS 1450, 277–285, 1998.
J. Hromkovic, S. Seibert, T. Wilke, Translating regular expressions into small ε-free nondeterministic finite automata, LNCS 1200, 55–66, 1997.
J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
J. Karhumäki, Combinatorial and computational problems on finite sets of words, Proc. MCU 2001, LNCS, to appear.
J. Karhumäki, I. Petre, On the centralizer of a finite set, Proc. ICALP 2000, LNCS 1853, 536–514, 2000.
E. Leiss, Language equations, Springer-Verlag, 1998.
M. Lothaire, Combinatorics on words, Addison-Wesley, 1983.
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.
W. Plandowski, Satisfiability of word equations with constants is in PSPACE, Proc. FOCS 1999, 1999.
B. Ratoandramanana, Codes et motifs, RAIRO Theor. Informat. 23, 425–444, 1989.
S. Yu, Regular languages, in G. Rozengerg, A. Salomaa (eds.), Handbook of Formal Languages, Springer, 41–110, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karhumäki, J., Plandowski, W., Rytter, W. (2001). On the Complexity of Decidable Cases of Commutation Problem for Languages. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive