Abstract
In this paper, we give an automata theoretic version of several algorithms dealing with profinite topologies. The profinite topology was first introduced for the free group by M. Hall, Jr. and by Reutenauer for the free monoid. It is the initial topology defined by all the monoid morphisms from the free monoid into a discrete finite group. For a variety of finite groups V, the pro-V topology is defined in the same way by replacing “group” by “group in V” in the definition. Recently, by a geometric approach, Steinberg developed an efficient algorithm to compute the closure, for some pro-V topologies (including the profinite one), of a rational language given by a finite automaton. In this paper we show that these algorithms can be obtained by an automata theoretic approach by using a result of Pin and Reutenauer. We also analyze precisely the complexity of these algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Almeida, J.: Dynamics of implicit operations and tameness of pseudovarieties of groups. preprint. (2000)
Benois, M.: Parties rationnelles du groupe libre. C.R. Acad. Sci. Paris 269 (1969)1188–1190
Benois, M., Sakarovitch, J.: On the complexity of some extended word problems defined by cancellation rules. Information Processing Letters 23 (1986) 281–287
Berstel, J.: Transductions and Context-Free-Languages. (1979)
Cormen, T.E., Leiserson, C.E., Rivest R.L.: Introduction to algorithms. MIT Press and McGraw-Hill Book Company. 6th edition (1992)
Delgado, M.: Abelian pointlikes of a monoid. Semigroup forum 56 (1986) 339–361
Eilenberg, S.: Automata, Languages and Machines. Academic Press. New York (1978)
Hall., M. A topology for free groups and related groups. Ann. of Maths. 52 (1950)
Henckell, K., Margolis, S., Pin, J.-E., Rhodes, J.: Ash’s type II theorem, profinite topology and Malcev products. part I. Int. J. Algebra and Comput. 1 (1991) 411–436
Margolis, S., Sapir, M., Weil, P.: Closed subgroups in pro-V topologies and the extension problem for inverse automata. (to appear)
Pin. J.-E.: On the language accepted by finite reversible automata. Automata, Languages and Programming, 14th International Colloquium. Lecture Notes in Computer Science 267 (1987) 237–249
Pin, J.-E.: A topological approach to a conjecture of Rhodes. Bull. Austral. Math. Soc. 38 (1988) 421–431
Pin, J.-E.: Topologies for the free monoid. Journal of Algebra 137 (1991) 297–337
Pin, J.-E.: Polynomial closure of group languages and open sets of the Hall topology. Lecture Notes in Computer Science 820 (1994) 424–432
Pin, J.-E, Reutenauer, C.: A conjecture on the Hall topology on a free group. Bull. London Math. Soc. 25 (1991) 356–362
Pin, J.-E, Weil, P.: Polynomial closure and unambiguous product. Lecture Notes in Computer Science 944 (1995) 348–388
Ribes, L., Zalesskii, P.: On the profinite topology on a free group. Bull. London Math. Soc. 25 (1993) 37–43
Ribes, L., Zalesskii, P.: The pro-p topology of a free group and algorithmic problems in semigroups. Int. J. Algebra and Comput. 4 (1994) 359–374
Rotman, J.: An introduction to the theory of groups. Springer. New York. 4th edition (1995)
Steinberg, B.: Finite state automata: A geometric approach. Technical report. Univ. of Porto. (1999)
Weil, P.: Computing closures of finitely generated subgroups of the free group. Proceedings of the International Conference on Algorithmic Problems in Groups and Semigroups (2000) 289–307
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Héam, PC. (2001). Automata for Pro-V Topologies. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive