Polynomial closure of group languages and open sets of the Hall topology

Theoretical Computer Science

Volumn 169, Issue 2, 1996, Pages 185-200

  Pin, Jean Eric ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTABILITY AND DECIDABILITY; FINITE AUTOMATA; POLYNOMIALS; SET THEORY; THEOREM PROVING; TOPOLOGY;

GROUP LANGUAGES; GROUP THEORY; HALL TOPOLOGY; POLYNOMIAL CLOSURE PROPERTY;

ALGORITHMIC LANGUAGES;

EID: 0030571377     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00120-X     Document Type: Article

References (26)

1. C.J. Ash, Inevitable sequences and a proof of the type II conjecture, in: Proc. Monash Conf. on Semigroup Theory (World Scientific, Singapore, 1991) 31-42.
2. C.J. Ash, Inevitable Graphs: A proof of the type II conjecture and some related decision procedures, Internat. J. Algebra Comp. 1 (1991) 127-146.
3. J. Berstel, Transductions and Context Free Languages (Teubner, Leipzig, 1979).
4. S. Eilenberg, Automata, Languages and Machines, Vol. A (Academic Press, New York, 1974).
5. S. Eilenberg, Automata, Languages and Machines, Vol. B (Academic Press, New York, 1976).
6. M. Hall Jr., A topology for free groups and related groups, Ann. of Maths 52 (1950) 127-139.
7. K. Henckell, S.W. Margolis, J.-E. Pin and J. Rhodes, Ash's Type II Theorem, Profinite Topology and Malcev Products, Internat. J. Algebra Comput. 1 (1991) 411-436.
8. K. Henckell and J. Rhodes, The theorem of Knast, the PG = BG and Type II Conjectures, in: J. Rhodes, ed., Monoids and Semigroups with Applications (Word Scientific, 1991) 453-463
9. S.W. Margolis and J.-E. Pin, Varieties of finite monoids and topology for the free monoid, in: K. Byleen, P. Jones and F. Pastijn, eds., Proc. 1984 Marquette Conf. on Semigroups, (Dept. Mathematics, Statistics and Computer Science, Marquette University, 1984) 113-130.
10. S.W. Margolis and J.E. Pin, Product of group languages, Proc. FCT Conf., Lecture Notes in Computer Science, Vol. 199 (Springer, Berlin, 1985) 285-299.
11. J.-E. Pin, Finite group topology and p-adic topology for free monoids, in: Proc. 12th ICALP, Lecture Notes in Computer Science, Vol. 194, (Springer, Berlin, 1985) 445-455.
12. J.-E. Pin, Variétés de langages formels (Masson, Paris, 1984). Varieties of formal languages (North Oxford Academic, London, 1986 and Plenum, New York, 1986).
13. J.-E. Pin, Variétés de langages formels (Masson, Paris, 1984). Varieties of formal languages (North Oxford Academic, London, 1986 and Plenum, New York, 1986).
14. J.-E. Pin, On the languages recognized by finite reversible automata, in: Proc. 14th ICALP, Lecture Notes in Computer Science, Vol. 267 (Springer, Berlin, 1987) 237-249.
15. J.-E. Pin, A topological approach to a conjecture of Rhodes, Bull. Austral. Math. Soc. 38 (1988) 421-431.
16. J.-E. Pin, Relational morphisms, transductions and operations on languages, in: J.E. Pin, ed., Formal Properties of Finite Automata and Applications, Lecture Notes in Computer Science, Vol. 386 (Springer, Berlin 1989) 120-137.
17. J.-E. Pin, Topologies for the free monoid, J. Algebra 137 (1991) 297-337.
18. J.-E. Pin, Logic, semigroups and automata on words, Annals of Mathematics and Artificial Intelligence 16 (1996) 343-384.
19. J.-E. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Notices London Math. Soc. 23 (1991) 356-362.
20. Ch. Reutenauer, Une topologie du monoïde libre, Semigroup Forum 18 (1979) 33-49.
21. Ch. Reutenauer, Sur mon article "Une topologie du monoïde libre", Semigroup Forum 22 (1981) 93-95.
22. L. Ribes and P.A. Zalesskii, On the profinite topology on a free group, Bull. London Math. Soc. 25 (1993) 37-43.
23. L. Ribes and P.A. Zalesskii, The pro- p topology of a free group and algorithmic problems in semigroups, Internat. J. Algebra Comp. 4 (1994) 359-374.
24. M.P. Schützenberger, Sur le produit de concaténation non ambigu, Semigroup Forum 13 (1976) 47-75.
25. I. Simon, The product of rational languages, in: Proc. ICALP 1993, Lecture Notes in Computer Science, Vol. 700 (Springer, Berlin, 1993), 430-444.
26. W. Thomas, Classifying regular events in symbolic logic, J. Comput. System Sci 25 (1982) 360-375.