Abstract
Finite semigroups, i.e. finites sets equipped with a binary associative operation, have played a role in theoretical computer science for fifty years. They were first observed to be closely related to finite automata, hence, by the famous theorem of Kleene, to regular languages. It was later understood that this association is very deep and the theory of pseudo-varieties of Schützenberger and Eilenberg [5] became the accepted framework in which to discuss computations realized by finite-state machines. It is today fair to say that semigroups and automata are so tightly intertwined that it makes little sense to study one without the other.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barrington, D., Thérien, D.: Finite Monoids and the Fine Structure of NC 1. J. ACM 35(4), 941–952 (1988)
Beaudry, M.: Languages recognized by finite aperiodic groupoids. TCS 209, 299–317 (1998)
Beaudry, M., Lemieux, F., Thérien, D.: Finite loops recognize exactly the regular open languages. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 110–120. Springer, Heidelberg (1997)
Caussinus, H., Lemieux, F.: The complexity of computing over quasigroups. In: Proc. 14th annual FST&TCS, pp. 36–47 (1994)
Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, London (1976)
Gavaldà, R., Thérien, D.: Learning expressions over monoids. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 283–293. Springer, Heidelberg (2001)
Gécseg, F., Steinby, M.: Tree Automata, Akadémiai Kiadó, Budapest (1984)
Kleene, S.C.: Representations of events in nerve nets and finite automata. In: Shannon, C.E. (ed.) Automata Studies, vol. 3(41). Priceton University Press, Princeton (1956)
Lemieux, F.: Finite groupoids and their applications to computational complexity, Ph.D. Thesis, McGill University (May 1996)
Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Inform. and Contr. 11, 3–29 (1967)
Pin, J.-E.: Varieties of Formal Languages. Plenum Press, New York (1986)
Koucky, M., Pudlak, P., Therien, D.: Bounded-depth circuits: separating wires from gates. In: Accepted in the 37th ACM Symposium on Theory of Computing, STOC (2005)
Schützenberger, M.-P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Schützenberger, M.-P.: Sur le produit de concaténation non ambigu. Semigroup Forum 13, 45–75 (1976)
Simon, I.: Piecewise Testable Events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975)
Tesson, P., Thérien, D.: Complete Classifications for the Communication Complexity of Regular Languages. In: Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (2003)
Tilson, B.: Categories as algebra: an essential ingredient in the theory of monoid. J. Pure and Applied Algebra 48, 83–198 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaudry, M., Lemieux, F., Thérien, D. (2005). Groupoids That Recognize Only Regular Languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_35
Download citation
DOI: https://doi.org/10.1007/11523468_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)