On language inequalities XK ⊆ LX

Lecture Notes in Computer Science

Volumn 3572, Issue , 2005, Pages 327-337

  Kunc, Michal ^a,b  

^a UNIVERSITY OF TURKU   (Finland)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE;

ARBITRARY LANGUAGES; FINITE LANGUAGES; STAR-FREE LANGUAGES;

FORMAL LANGUAGES;

EID: 26444468965     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11505877_29     Document Type: Conference Paper

References (21)

1. Aiken, A., Kozen, D., Vardi, M., Wimmers, E.: The complexity of set constraints. In Proc. CSL'93, LNCS 832, Springer (1994) 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 (2001) 217-232.
3. Charatonik, W., Podelski, A.: Co-definite set constraints. In Proc. RTA-98, LNCS 1379, Springer (1998) 211-225.
4. Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: A challenging problem. Theoret. Comput. Sci. 273 (2002) 69-79.
5. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971).
6. Karhumäki J., Latteux M., Petre, I.: Commutation with codes. Theoret. Comput. Sci., to appear.
7. Karhumäki J., Latteux M., Petre, I.: Commutation with ternary sets of words. Theory Comput. Syst. 38(2) (2005) 161-169.
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-493.
9. Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci., to appear.
10. Extended abstract in Proc. ICALP 2004, LNCS 3142, Springer (2004) 870-881.
11. Kunc, M.: Simple language equations. Bull. EATCS 85 (2005) 81-102.
12. Kunc, M.: The power of commuting with finite sets of words. Manuscript (2004), available at http://www.math.muni.cz/~kunc/.
13. Extended abstract in Proc. STACS 2005, LNCS 3404, Springer (2005).
14. Kunc, M.: Largest solutions of left-linear language inequalities. Manuscript (2005), available at http://www.math.muni.cz/~kunc/
15. Leiss, E.L.: Language Equations. Springer (1999).
16. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967).
17. Okhotin, A.: Decision problems for language equations. Submitted for publication, available at http://www.cs.queensu.ca/home/okhotin/.
18. Preliminary version in Proc. ICALP 2003, LNCS 2719, Springer (2003) 239-251.
19. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969) 1-35.
20. Ratoandromanana, B.: Codes et motifs. RAIRO Inform. Théor. Appl. 23(4) (1989) 425-444.
21. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer (1997).