Polynomial closure and topology

International Journal of Algebra and Computation

Volumn 10, Issue 5, 2000, Pages 603-624

  Steinberg, Benjamin ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Algorithmic Problems; Ordered Monoids; Polynomial Closure; Profinite Topology; Pseudoidentities; Pseudovarieties of Groups; Rational Languages

Indexed keywords

EID: 0034412507     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196700000285     Document Type: Article

References (32)

1. J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, 1994.
2. C. J. Ash, Inevitable graphs: A proof of the Type II conjecture and some related decision procedures, Int. J. Algebra Comput. 1 (1991), 127-146.
3. J. A. Brzozowski, Hierarchies of aperiodic languages, RAIRO Inform. Théor. 10 (1976), 33-49.
4. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974: Vol. B, 1976.
5. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974: Vol. B, 1976.
6. M. Hall, A topology for free groups and related groups, Ann. Math. 52 (1950), 127-139.
7. K. Henckell, S. Margolis, J.-E. Pin, and J. Rhodes, Ash's type II theorem, profinite topology and Malcev products. Part I, Int. J. Algebra Comput. 1 (1991), 411-436.
8. S. W. Margolis and J.-E. Pin, Varieties of finite monoids and topology for the free monoid, Proc. 1984 Marquette Conf. Semigroups eds. K. Byleen, P. Jones and F. Pastijn, Marquette University (1984), 113-130.
9. 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.
10. S. W. Margolis, M. Sapir and P. Weil, Closed subgroups in pro-V topologies and the extension problem for inverse automata, Int. J. Algebra Comput., to appear.
11. J.-E Pin, BG = PG, a success story, in NATO Advanced Study Institute, Semigroups, Formal Languages and Groups, ed. J. Fountain, Kluwer Academic Publishers, 1995, 33-47.
12. J.-E. Pin, Eilenberg's theorem for positive varieties of languages, Russian Math. (Iz. VUZ) 39 (1995), 74-83.
13. J.-E. Pin, Syntactic semigroups, Chapter 10 in Handbook of Language Theory, Vol. I, eds. G. Rozenberg and A. Salomaa, Springer Verlag, 1997, 679-746.
14. J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, Theor. Comput. Sci. 169 (1996), 185-200.
15. J.-E. Pin, Bridges for concatenation hierarchies, in 25th ICALP, Berlin, 1998, Lecture Notes in Computer Science 1443, Springer Verlag, pp. 431-442.
16. J.-E. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Bull. London Math. Soc. 23 (1991), 356-362.
17. J.-E. Pin and P. Weil, A Reiterman theorem for pseudovarieties of finite first-order structures, Algebra Universali 35 (1996), 577-595.
18. J.-E. Pin and P. Weil, Mal'cev products and identities, J. Algebra 182 (1996), 604-626.
19. J.-E. Pin and P. Weil, Polynomial closure and unambiguous product, Theory Comput. Syst. 30 (1997), 1-39.
20. J. Reiterman, The Birkhoff thoerem for finite algebras, Algebra Universalis 14 (1982), 227-268.
21. L. Ribes and P. A. Zalesskii, On the profinite topology on a free group, Bull. London Math. Soc. 25 (1993) 37-43.
22. L. Ribes and P. A. Zalesskii, The pro-p topology of a free group and algorithmic problems in semigroups, Int. J. Algebra Comput. 4 (1994), 359-374.
23. B. Steinberg, Inevitable graphs and profinite topologies: Some solutions to algorithmic problems in monoid and automata theory stemming from group theory, Int. J. Algebra Comput., to appear.
24. B. Steinberg, Monoid kernels and profinite topologies on a free abelian group, Bull. Austral. Math. Soc., 60 (1999), 391-402.
25. B. Steinberg, A note on the equation PH = J * H, Semigroup Forum, to appear.
26. B. Steinberg, Finite state automata: A geometric approach, Technical Report, University of Porto, 1999.
27. B. Steinberg, Inverse automata and profinite topologies on a free group, Technical Report, University of Porto, 1999.
28. H. Straubing, Finite semigroup varieties of the form V * D, J. Pure Appl. Algebra 36 (1985), 53-94.
29. H. Straubing, Finite automata, logic and circuit complexity, Birkhäuser, Boston, 1994.
30. H. Straubing and D. Thérien, Partially ordered finite monoids and a theorem of I. Simon, J. Algebra 119 (1985), 393-399.
31. P. Weil, Closure of varieties of languages under products with counter, J. Comput. Syst. Sci. 45 (1992), 316-339.
32. P. Weil, Some results on the dot-depth hierarchy, Semigroup Forum, 46 (1993), 352-370.