Fixed point approach to commutation of languages

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

Volumn 2950, Issue , 2004, Pages 119-131

  Culik II, Karel ^a   Karhumäki, Juhani ^b   Salmela, Petri ^b  

^a The Department of Mechanical Engineering   (United States)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FINITE LANGUAGES; FIXED POINTS; INFINITE NUMBERS;

ARTIFICIAL INTELLIGENCE;

EID: 33644527720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (18)

1. Berstel, J., Karhumäki, J.: Combinatorics on words - A tutorial, Bull. EATCS 79 (2003), 178-229.
2. Choffrut, G., Karhumäki, J.: Combinatorics of Words. In Rozenberg, G., Salomaa, A. (eds.), Handbook of Formal Languages, Vol. 1, Springer-Verlag (1997) 329-438.
3. Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: a challenging problem, Theoret. Comput. Sci., 273 (1-2) (2002) 69-79.
4. Harju, T., Ibarra, O., Karhumäki, J., Salomaa, A., Decision questions concerning semilinearity, morphisms and commutation of languages, J. Comput. System Sci. 65 (2002) 278-294.
5. Hopcroft, J., Ullman, J., Introduction to Automata Theory, Languages and Computation, Addison-Wesley (1979).
6. Karhumäki, J.: Challenges of commutation: an advertisement, in Proc of FCT 2001, LNCS 2138, Springer (2001) 15-23
7. Karhumäki, J., Latteux, M., Petre, I.: The commutation with codes and ternary sets of words, in Proc. of STACS 2003, LNCS 2607, Springer (2003), 74-84; final version to appear.
8. Karhumäki, J. and Petre, I.: Conway's problem for three-word sets, Theoret. Comput. Sci., 289/1 (2002) 705-725.
9. Karhumäki, J. and Petre, I., Two problems on commutation of languages, in: G. Pǎun, G. Rozenberg and A. Salomaa (eds.), Current Trends in Theoretical Computer Science, World Scientific, to appear.
10. Karhumäki, J., Plandowski, W., Rytter, W.: On the complexity of decidable cases of the commutation problem of languages, LNCS 2138, Springer (2001) 193-203; final version to appear.
11. Lothaire, M.: Combinatorics on Words (Addison-Wesley, Reading, MA.), (1983).
12. Lothaire, M.: Algebraic Combinatorics on Words (Cambridge University Press), (2002).
13. Pǎun, G., Rozenberg, G. and Salomaa, A., DNA Computing. New Computing Paradigms, Texts in Theoretical Computer Science. An EATCS series. Springer (1998)
14. Petre, I.: Commutation Problems on Sets of Words and Formal Power Series, PhD Thesis, University of Turku (2002)
15. Ratoandromanana, B.: Codes et motifs, RAIRO Inform. Theor., 23(4) (1989) 425-444.
16. Salmela, P., Rationaalisen kielen sentralisaattorista ja sen määrittämisestä kiintopistemetodilla, Master's theses, University of Turku (2002)
17. Salomaa, A., Formal Languages, Academic Press (1973).
18. Grail+ 3.0 - software package, Department of Computer Science, University of Western Ontario, Canada, http://www.csd.uwo.ca/research/grail/grail.html.