Profinite methods in automata theory

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 31-50

  Pin, Jean Éric ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Finite automata; Profinite topology; Regular languages; Uniform space

Indexed keywords

CONCRETE APPLICATIONS; TOPOLOGICAL APPROACH; UNIFORM SPACES;

COMPUTER SCIENCE; FINITE AUTOMATA; FORMAL LANGUAGES; SURVEYS; TOPOLOGY;

AUTOMATA THEORY;

EID: 70350757706     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (43)

1. J. Almeida, Residually finite congruences and quasi-regular subsets in uniform algebras, Partugaliæ Mathematica 46 (1989), 313-328.
2. J. Almeida, Finite semigroups and universal algebra, World Scientific Publishing Co. Inc., River Edge, NJ, 1994. Translated from the 1992 Portuguese original and revised by the author.
3. J. Almeida, Profinite semigroups and applications, in Structural theory of automata, semigroups, and universal algebra, pp. 1-45, NATO Sci. Ser. II Math. Phys. Chem. vol. 207, Springer, Dordrecht, 2005. Notes taken by Alfredo Costa.
4. J. Almeida and M. V. Volkov, Profinite identities for finite semigroups whose subgroups belong to a given pseudovariety, J. Algebra Appl. 2, 2 (2003), 137-163.
5. J. Almeida and P. Weil, Relatively free profinite monoids: an introduction and examples, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (éd.), vol. 466, pp. 73-117, Kluwer Academic Publishers, 1995.
6. C. J. Ash, Inevitable graphs: a proof of the type II conjecture and some related decision procedures, Internat. J. Algebra Comput. 1, 1 (1991), 127-146.
7. J. Berstel, M. Crochemore and J.-E. Pin, Thue sequence and p-adic topology of the free monoid, Discrete Mathematics 76 (1989), 89-94.
8. G. Birkhoff, Moore-Smith convergence in general topology, Ann. of Math. (2) 38, 1 (1937), 39-56.
9. M. J. J. Branco, Varieties of languages, in Semigroups, algorithms, automata and languages (Coimbra, 2001), pp. 91-132, World Sci. Publ., River Edge, NJ, 2002.
10. S. Eilenberg, Automata, languages, and machines. Vol. B, Academic Press [Harcourt Brace Jovanovich Publishers], New York, 1976.
11. Z. Ésik and M. Ito, Temporal logic with cyclic counting and the degree of aperiodicity of finite automata, Acta Cybernetica 16 (2003), 1-28.
12. M. Gehrke, S. Grigorieff and J.-E. Pin, Duality and equational theory of regular languages, in ICALP 2008, Part II, L. Aceto and al. (éd.), Berlin, 2008, pp. 246-257, Lect. Notes Comp. Sci. vol. 5126, Springer.
13. M. Hall, Jr., A topology for free groups and related groups, Ann. of Math. (2) 52 (1950), 127-139.
14. R. Hunter, Certain finitely generated compact zero-dimensional semigroups, J. Austral. Math. Soc. (Series A) 44 (1988), 265-270.
15. M. Lothaire, Combinatorics on words, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1997. With a foreword by Roger Lyndon and a preface by Dominique Perrin, Corrected reprint of the 1983 original, with a new preface by Perrin.
16. K. Mahler, An interpolation series for continuous functions of a p-adic variable., J. Reine Angew. Math. 199 (1958), 23-34.
17. Correction 208 (1961), 70-72.
18. K. Mahler, A correction to the paper "An interpolation series for continuous functions of a p-adic variable.", J. Reine Angew. Math. 208 (1961), 70-72.
19. S. Margolis, M. Sapir and P. Weil, Closed subgroups in pro-V topologies and the extension problem for inverse automata, Internat. J. Algebra Comput. 11, 4 (2001), 405-445.
20. J.-E. Pin, Topologies for the free monoid, J. of Algebra 137 (1991), 297-337.
21. J.-E. Pin, On reversible automata, in Proceedings of the first LATIN conference, São-Paulo, 1992, pp. 401-416, Lect. Notes Comp. Sci. no 583, Springer.
22. J.-E. Pin, Topologie p-adique sur les mots, Journal de théorie des nombres de Bordeaux 5 (1993), 263-281.
23. J.-E. Pin, A variety theorem without complementation, Russian Mathematics (Iz. VUZ) 39 (1995), 80-90.
24. J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, Theoret. Comput. Sci. 169 (1996), 185-200.
25. J.-E. Pin, Syntactic semigroups, in Handbook of formal languages, G. Rozenberg and A. Salomaa (éd.), vol. 1, ch. 10, pp. 679-746, Springer, 1997.
26. J.-E. Pin, The expressive power of existential first order sentences of Büchi's sequential calculus, Discrete Mathematics 291 (2005), 155-174.
27. J.-E. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Bull. London Math. Soc. 23 (1991), 356-362.
28. J.-E. Pin and P. V. Silva, A topological approach to transductions, Theoret. Comput. Sci. 340 (2005), 443-456.
29. J.-E. Pin and P. V. Silva, A Mahler's theorem for functions from words to integers, in 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), S. Albers and P. Weil (éd.), Dagstuhl, Germany, 2008, pp. 585-596, Internationales Begegnungs-Und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
30. J.-E. Pin and P. Weil, Polynomial closure and unambiguous product, Theory Comput. Systems 30 (1997), 1-39.
31. J.-E. Pin and P. Weil, Uniformities on free semigroups, International Journal of Algebra and Computation 9 (1999), 431-453.
32. N. Pippenger, Regular languages and Stone duality, Theory Comput. Syst. 30, 2 (1997), 121-134.
33. N. R. Reilly and S. Zhang, Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands, Algebra Universalis 44, 3-4 (2000), 217-239.
34. J. Reiterman, The Birkhoff theorem for finite algebras, Algebra Universalis 14, 1 (1982), 1-10.
35. C. Reutenauer, Une topologie du monoïde libre, Semigroup Forum 18, 1 (1979), 33-49.
36. C. Reutenauer, Sur mon article: "Une topologie du monoïde libre"
37. Semigroup Forum 22, 1 (1981), 93-95.
38. Semigroup Forum 18 (1979), no. 1, 33-49; MR 80j:20075
39. L. Ribes and P. A. Zalesskii, On the profinite topology on a free group, Bull. London Math. Soc. 25, 1 (1993), 37-43.
40. L. Ribes and P. A. Zalesskii, The pro-p topology of a free group and algorithmic problems in semigroups, Internat. J. Algebra Comput. 4, 3 (1994), 359-374.
41. M. H. Stone, The representation of Boolean algebras, Bull. Amer. Math. Soc. 44, 12 (1938), 807-816.
42. H. Straubing, On logical descriptions of regular languages, in LATIN 2002, Berlin, 2002, pp. 528-538, Lect. Notes Comp. Sci. no 2286, Springer.
43. P. Weil, Profinite methods in semigroup theory, Int. J. Alg. Comput. 12 (2002), 137-178.