The power of commuting with finite sets of words

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 569-580

  Kunc, Michal ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONTEXT FREE LANGUAGES;

FINITE SETS; LANGUAGE COMMUTING; SEMI-LINEAR INEQUALITIES;

FORMAL LANGUAGES;

EID: 20344364492     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_47     Document Type: Conference Paper

References (17)

1. Baader, F., Küsters, R.: Unification in a description logic with transitive closure of roles. In Proc. LPAR 2001, LNCS 2250, Springer (2001) 217-232.
2. Bergman, G.M.: Centralizers in free associative algebras. Trans. Amer. Math. Soc. 137 (1969) 327-344.
3. Choffrut, G., Karhumäki, J., Ollinger, N.: The commutation of finite sets: A challenging problem. Theoret. Comput. Sci. 273 (2002) 69-79.
4. Cohn, P.M.: Factorization in non-commutative power series rings. Proc. Cambridge Philos. Soc. 58 (1962) 452-464.
5. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971).
6. Karhumäki, J., Petre, I.: Conway's problem for three-word sets. Theoret. Comput. Sci. 289 (2002) 705-725.
7. Karhumäki, J., Petre, I.: The branching point approach to Conway's problem. In Formal and Natural Computing, LNCS 2300, Springer (2002) 69-76.
8. Karhumäki, J., Petre, I.: Two problems on commutation of languages. In Current Trends in Theoretical Computer Science, The Challenge of the New Century, vol. 2, World Scientific (2004) 477-494.
9. Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci. (to appear). Extended abstract in Proc. ICALP 2004, LNCS 3142, Springer (2004) 870-881.
10. Kunc, M.: The power of commuting with finite sets of words. Manuscript (2004). Available at http://www.math.muni.cz/~kunc/
11. Leiss, E.L.: Language Equations. Springer (1999).
12. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967).
13. Okhotin, A.: Decision problems for language equations. Submitted for publication (2003). Available at http://www.cs.queensu.ca/home/okhotin/
14. Okhotin, A.: Greatest solutions of language equations. Submitted for publication (2003). Available at http://www.cs.queensu.ca/home/okhotin/
15. Okhotin, A.: On computational universality in language equations. In Proc. MCU 2004, LNCS 3354, Springer (to appear).
16. Ratoandromanana, B.: Codes et motifs. RAIRO Inform. Théor. Appl. 23 (1989) 425-444.
17. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer (1997).