Regular solutions of language inequalities and well quasi-orders

Theoretical Computer Science

Volumn 348, Issue 2-3 SPEC. ISS., 2005, Pages 277-293

  Kunc, Michal ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Finite simple semigroup; Language equation; Regular language; Syntactic semigroup; Well quasi order

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY;

FINITE SIMPLE SEMIGROUP; LANGUAGE EQUATION; SYNTACTIC SEMIGROUP; WELL QUASI-ORDER;

FORMAL LANGUAGES;

EID: 33644527551     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.018     Document Type: Conference Paper

References (19)

1. F. Baader, R. Küsters, Unification in a description logic with transitive closure of roles, in: R. Nieuwenhuis, A. Voronkov (Eds.), Proc. eighth Internat. Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001), Lecture Notes in Computer Science, vol. 2250, Springer, Berlin, 2001, pp. 217-232.
2. W. Bucher, A. Ehrenfeucht, and D. Haussler On total regulators generated by derivation relations Theoret. Comput. Sci. 40 1985 131 148
3. C. Choffrut, J. Karhumäki, and N. Ollinger The commutation of finite sets: a challenging problem Theoret. Comput. Sci. 273 2002 69 79
4. J.H. Conway Regular Algebra and Finite Machines 1971 Chapman & Hall London
5. K. Culik II, J. Karhumäki, P. Salmela, Fixed point approach to commutation of languages, in: N. Jonoska, Gh. Pǎun, G. Rozenberg (Eds.), Aspects of Molecular Computing, Lecture Notes in Computer Science, vol. 2950, Springer, Berlin, 2004, pp. 119-131.
6. A. de Luca, and S. Varricchio Finiteness and Regularity in Semigroups and Formal Languages 1999 Springer Berlin
7. A. Ehrenfeucht, D. Haussler, and G. Rozenberg On regularity of context-free languages Theoret. Comput. Sci. 27 1983 311 332
8. J.M. Howie Fundamentals of Semigroup Theory 1995 Clarendon Press Oxford
9. J. Karhumäki, and I. Petre Conway's problem for three-word sets Theoret. Comput. Sci. 289 2002 705 725
10. J. Karhumäki, and I. Petre Two problems on commutation of languages Gh. Pǎun G. Rozenberg A. Salomaa Current Trends in Theoretical Computer Science 2004 World Scientific Singapore 477 494
11. D. Kirsten The finite power problem revisited Inform. Process. Lett. 84 2002 291 294
12. J.B. Kruskal Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture Trans. Amer. Math. Soc. 95 1960 210 225
13. J.B. Kruskal The theory of well-quasi-ordering: a frequently discovered concept J. Combin. Theory Ser. A 13 1972 297 305
14. M. Kunc, The power of commuting with finite sets of words, manuscript (2004), available at http://www.math.muni.cz/ ∼ kunc/, extended abstract in: Proc. 22nd Symp. on Theoretical Aspects of Computer Science (STACS 2005), Lecture Notes in Computer Science, vol. 3404, Springer, Berlin, 2005, pp. 569-580.
15. E.L. Leiss Language Equations 1999 Springer New York
16. A. Okhotin, Decision problems for language equations, 2003, submitted for publication, available at http://www.cs.queensu.ca/home/okhotin/.
17. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 1, Springer, Berlin, 1997.
18. A. Suschkewitsch Über die endlichen Gruppen ohne das Gesetz der eindeutigen Umkehrbarkeit Math. Ann. 99 1928 30 50
19. S. Zhang Efficient simplicity testing of automata Theoret. Comput. Sci. 99 1992 265 278