Abstract
We show that the maximal set commuting with a given regular set – its centralizer – can be defined as the maximal fixed point of a certain language operator. Unfortunately, however, an infinite number of iterations might be needed even in the case of finite languages.
Supported by the Academy of Finland under grant 44087
This is a preview of subscription content, log in via an institution to check access.
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
Berstel, J., Karhumäki, J.: Combinatorics on words – A tutorial. Bull EATCS 79, 178–229 (2003)
Choffrut, C., Karhumäki, J.: Combinatorics of Words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 329–438. Springer, Heidelberg (1997)
Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: a challenging problem. Theoret. Comput. Sci. 273(1-2), 69–79 (2002)
Harju, T., Ibarra, O., Karhumäki, J., Salomaa, A.: Decision questions concerning semilinearity, morphisms and commutation of languages. J. Comput. System Sci. 65, 278–294 (2002)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Karhumäki, J.: Challenges of commutation: an advertisement. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 15–23. Springer, Heidelberg (2001)
Karhumäki, J., Latteux, M., Petre, I.: The commutation with codes and ternary sets of words. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 74–84. Springer, Heidelberg (2003)
Karhumäki, J., Petre, I.: Conway’s problem for three-word sets. Theoret. Comput. Sci. 289(1), 705–725 (2002)
Karhumäki, J., Petre, I.: Two problems on commutation of languages. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science, World Scientific, Singapore (to appear)
Karhumäki, J., Plandowski, W., Rytter, W.: On the complexity of decidable cases of the commutation problem of languages. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 193–203. Springer, Heidelberg (2001)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Theoretical Computer Science. An EATCS series. Springer, Heidelberg (1998)
Petre, I.: Commutation Problems on Sets of Words and Formal Power Series, PhD Thesis, University of Turku (2002)
Ratoandromanana, B.: Codes et motifs. RAIRO Inform. Theor. 23(4), 425–444 (1989)
Salmela, P.: Rationaalisen kielen sentralisaattorista ja sen määrittämisestä kiintopistemetodilla, Master’s theses. University of Turku (2002)
Salomaa, A.: Formal Languages. Academic Press, London (1973)
Grail+ 3.0 – software package, Department of Computer Science. University of Western Ontario, Canada, http://www.csd.uwo.ca/research/grail/grail.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Culik, K., Karhumäki, J., Salmela, P. (2003). Fixed Point Approach to Commutation of Languages. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24635-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20781-8
Online ISBN: 978-3-540-24635-0
eBook Packages: Springer Book Archive