Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-27T08:42:03.691Z Has data issue: false hasContentIssue false
  • English
  • Français

Equational description of pseudovarieties of homomorphisms

Published online by Cambridge University Press:  15 November 2003

Michal Kunc
Michal Kunc*
Affiliation:
Department of Mathematics, Masaryk University, Janáčkovo nám. 2a, 662 95 Brno, Czech Republic; URL: ; [email protected].
Get access

Abstract

The notion of pseudovarieties of homomorphisms onto finite monoids was recently introduced by Straubing as an algebraic characterization for certain classes of regular languages. In this paper we provide a mechanism of equational description of these pseudovarieties based on an appropriate generalization of the notion of implicit operations. We show that the resulting metric monoids of implicit operations coincide with the standard ones, the only difference being the actual interpretation of pseudoidentities. As an example, an equational characterization of the pseudovariety corresponding to the class of regular languages in AC0 is given.

Keywords

pseudovarietypseudoidentityimplicit operationvariety of regular languagessyntactic homomorphism.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 37 , Issue 3 , July 2003 , pp. 243 - 254
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

J. Almeida, Finite Semigroups and Universal Algebra. World Scientific, Singapore (1995).
Mix Barrington, D., Compton, K., Straubing, H. and Thérien, D., Regular languages in NC 1. J. Comput. System Sci. 44 (1992) 478-499. CrossRef
S. Eilenberg, Automata, Languages and Machines. vol. B, Academic Press, New York (1976).
Pin, J.E., A variety theorem without complementation. Russian Math. (Iz. VUZ) 39 (1995) 74-83.
Reiterman, J., The Birkhoff theorem for finite algebras. Algebra Universalis 14 (1982) 1-10. CrossRef
Schützenberger, M.P., On finite monoids having only trivial subgroups. Inform. and Control 8 (1965) 190-194. CrossRef
H. Straubing, On the logical description of regular languages. in Proc. 5th Latin American Sympos. on Theoretical Informatics (LATIN 2002), edited by S. Rajsbaum, Lecture Notes in Comput. Sci., vol. 2286, Springer, Berlin (2002) 528-538.