Some results on C-varieties

RAIRO - Theoretical Informatics and Applications

Volumn 39, Issue 1, 2005, Pages 239-262

  Pin, Jean Éric ^a   Straubing, Howard ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b BOSTON COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; POLYNOMIALS; PROBLEM SOLVING; SYNTACTICS; THEOREM PROVING;

POLYNOMIAL CLOSURE; REGULAR LANGUAGE; REITERMAN'S THEOREM; SYNTACTIC MORPHISM;

FINITE AUTOMATA;

EID: 16244400147     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2005014     Document Type: Article

References (19)

1. 1. J. Comput. Syst. Sci. 44 (1992) 478-499.
2. M. Branco, Varieties of languages, in Semigroups, Algorithms, Automata and Languages, edited by G.M.S. Gomes, J.-É. Pin and P. Silva. World Scientific (2002) 91-132.
3. S. Eilenberg, Automata, languages, and machines. Vol. B. Academic Press, Harcourt Brace Jovanovich Publishers, New York, (1976). With two chapters ("Depth decomposition theorem" and "Complexity of semigroups and morphisms") by Bret Tilson. Pure Appl. Math. 59.
4. S. Eilenberg, Automata, languages, and machines. Vol. B. Academic Press, Harcourt Brace Jovanovich Publishers, New York, (1976). With two chapters ("Depth decomposition theorem" and "Complexity of semigroups and morphisms") by Bret Tilson. Pure Appl. Math. 59.
5. S. Eilenberg and M.-P. Schützenberger, On pseudovarieties. Adv. Math. 19 (1976) 413-418.
6. M. Kunc, Equational description of pseudovarieties of homomorphisms. Theor. Inform. Appl. 37 (2003) 243-254.
7. D. Perrin and J.-É. Pin, Infinite Words. Pure and Applied Mathematics 141 2004.
8. J.-É. Pin, A variety theorem without complementation. Russian Math. (Izvestija vuzov. Matematika) 39 (1995) 80-90.
9. J.-É. Pin, Syntactic semigroups, in Handbook of formal languages, edited by G. Rozenberg and A. Salomaa. Springer-Verlag 1 (1997) 679-746.
10. J.-É. Pin, Algebraic tools for the concatenation product. Theoret. Comput. Sci. 292 (2003) 317-342.
11. J.-É. Pin, H. Straubing and D. Thérien, Some results on the generalized star-height problem. Inform. Comput. 101 (1992) 219-250.
12. J.-É. Pin and P. Weil, Profinite semigroups, mal'cev products and identities. J. Algebra 182 (1996) 604-626.
13. J.-É. Pin and P. Weil, Polynomial closure and unambiguous product. Theory Comput. Syst. 30 (1997) 1-39.
14. J.-É. Pin and P. Weil, Semidirect products of ordered semigroups. Commun. Algebra 30 (2002) 149-169.
15. J. Reiterman, The Birkhoff theorem for finite algebras. Algebra Universalis 14 (1982) 1-10.
16. I. Simon, Hierarchies of Events with Dot-Depth One. Ph.D. Thesis, University of Waterloo, Waterloo, Ontario, Canada (1972).
17. I. Simon, Piecewise testable events, in Proc. 2nd GI Conf., edited by H. Brackage. Springer-Verlag, Berlin, Heidelberg, New York. Lect. Notes Comp. Sci. 33 (1975) 214-222.
18. H. Straubing, Finite automata, formal logic, and circuit complexity. Birkhäuser Boston Inc., Boston, MA (1994).
19. H. Straubing, On logical descriptions of regular languages, in LATIN 2002. Springer, Berlin, Lect. Notes Comput. Sci. 2286 (2002) 528-538.