The power of commuting with finite sets of words

Theory of Computing Systems

Volumn 40, Issue 4, 2007, Pages 521-551

  Kunc, Michal ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE LANGUAGES; FINITE SET; LANGUAGE COMMUTING; MAXIMAL SOLUTION; SEMI-LINEAR INEQUALITIES;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 34547231669     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1321-z     Document Type: Conference Paper

References (23)

1. Aiken, A., Kozen, D., Vardi, M., Wimmers, E.: The complexity of set constraints. In Proc. CSL '93, LNCS 832, Springer, Berlin (1994), pp. 1-17.
2. Baader, F., Küsters, R.: Unification in a description logic with transitive closure of roles. In Proc. LPAR 2001, LNCS 2250, Springer, Berlin (2001), pp. 217-232.
3. Bergman, G.M.: Centralizers in free associative algebras. Trans. Amer. Math. Soc. 137 (1969), 327-344.
4. Cassaigne, J., Karhumäki, J., Manuch, J.: On conjugacy of languages. Theoret. Inform. Appl. 35(6) (2001), 535-550.
5. Charatonik, W., Podelski, A.: Co-definite set constraints. In Proc. RTA-98, LNCS 1379, Springer, Berlin (1998), pp. 211-225.
6. Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: a challenging problem. Theoret. Comput. Sci. 273 (2002), 69-79.
7. Cohn, P.M.: Factorization in non-commutative power series rings. Math. Proc. Cambridge Philos. Soc. 58 (1962), 452-464.
8. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971).
9. Karhumäki, J., Latteux, M., Petre, I.: Commutation with ternary sets of words. Theory Comput. Systems 38(2) (2005), 161-169.
10. Karhumäki, J., Latteux, M., Petre, I.: Commutation with codes. Theoret. Comput. Sci. 340(2) (2005), 322-333.
11. Karhumäki, J., Petre, I.: The branching point approach to Conway's problem. In Formal and Natural Computing, LNCS 2300, Springer, Berlin (2002), pp. 69-76.
12. 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, Singapore (2004), pp. 477-494.
13. Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci. 348(2-3) (2005), 277-293.
14. Kunc, M.: Simple language equations. Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS 85 (2005), 81-102.
15. Kunc, M.: On language inequalities XK ∪ LX. In Proc. DLT 2005, LNCS 3572, Springer, Berlin (2005), pp. 327-337.
16. Kunc, M.: Largest solutions of left-linear language inequalities. In Proc. AFL 2005 (2005), pp. 178-186. Also available at http://www.math.muni.cz/~kunc/.
17. Leiss, E.L.: Language Equations. Springer, New York. (1999).
18. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, NJ (1967).
19. Okhotin, A.: Decision problems for language equations. Submitted for publication. Preliminary version in Proc. ICALP 2003, LNCS 2719, Springer, Berlin (2003), pp. 239-251.
20. Okhotin, A.: On computational universality in language equations. In Proc. MCU 2004, LNCS 3354, Springer, Berlin (2005), pp. 292-303.
21. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969), 1-35.
22. Ratoandromanana, B.: Codes et motifs. RAIRO Inform. Théor. Appl. 23 (1989), 425-444.
23. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, New York. (1997).