Factorizations of languages and commutativity conditions

Acta Cybernetica

Volumn 15, Issue 3, 2002, Pages 339-351

  Mateescu, Alexandru ^a   Salomaa, Arto ^b   Yu, Sheng ^c  

^a UNIVERSITY OF BUCHAREST   (Romania)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Catenation; Commutativity of languages; Finite language; Prime decomposition

Indexed keywords

EID: 0036033303     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Bergman, G.; Centralizers in free associative algebras, Trans. Amer. Math. Soc. 137 (1969) 327-344.
2. Bucher, W., Maurer, H. A., Culik, K., II and Wotschke, D.; Concise description of finite languages, Theoret. Comput. Sci. 14 (1981), no. 3, 227-246.
3. Choffrut, C., Karhumäki, J. and Ollinger, N.; The commutation of finite sets: a challenging problem, TUCS Technical Report 303 (1999), to appear in Theoret. Comput. Sci.
4. Karhumäki, J. and Petre, I.; On the centralizer of a finite set, Springer LNCS 1853 (2000) 536-546.
5. Mateescu, A., Salomaa, A. and Yu, S.; On the decomposition of finite languages, TUCS Technical Report 222 (1998).
6. Rozenberg, G. and Salomaa, A.; (eds) Handbook of Formal Languages, Springer, Berlin, New York, 1997.
7. Salomaa, A.; Theory of Automata, International Series of Monographs in Pure and Applied Mathematics, Vol. 100 Pergamon Press, Oxford-New York-Toronto, 1969.
8. Salomaa, A.; Formal Languages, Academic Press, New York, London, 1973.
9. Salomaa, A. and Yu, S.; On the decomposition of finite languages, DLT 99 Preproceedings, Aachener Informatik-Berichte 99-5 (1999) 8-20.
10. Appears also in: Rozenberg, G. and Thomas, W.; (eds.) Developments in Language Theory. World Scientific, 2000, 22-31.
11. Shyr, H.J.; Free Monoids and Languages, Hon Min Book Company, Taichung, Taiwan R.O.C., 1991.