Regular solutions of language inequalities and well quasi-orders

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

Volumn 3142, Issue , 2004, Pages 870-881

  Kunc, Michal ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FREE MONOIDS; MAXIMAL SOLUTION; REGULAR SOLUTION; SEMIGROUPS; WELL QUASI ORDERS;

COMPUTATIONAL LINGUISTICS;

EID: 35048889061     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_73     Document Type: Article

References (16)

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. Choffrut, C., Karhumäki, J., Ollinger, N.: The commutation of finite sets: A challenging problem. Theor. Comput. Sci. 273 (2002) 69-79.
3. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971).
4. Ehrenfeucht, A., Haussler, D., Rosenberg, G.: On regularity of context-free languages. Theor. Comput. Sci. 27 (1983) 311-332.
5. Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2 (1952) 326-336.
6. Howie, J.M.: Fundamentals of Semigroup Theory. Oxford University Press (1995).
7. Karhumäki, J., Petre, I.: Conway's problem for three-word sets. Theor. Comput. Sci. 289 (2002) 705-725.
8. Karhumäki, J., Petre, I.: Two problems on commutation of languages. In Current Trends in Theoretical Computer Science, World Scientific (to appear).
9. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc. 95 (1960) 210-225.
10. Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory, Ser. A, 13 (1972) 297-305.
11. ∼kunc
12. ∼kunc
13. Leiss, E.L.: Language Equations. Springer (1999).
14. Okhotin, A.: Decision problems for language equations, submitted (2003).
15. Okhotin, A.: Greatest solutions of language equations, submitted (2003).
16. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer (1997).