Abstract
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is not necessarily associative. It is well known that L can be recognized by a groupoid iff L is context-free. But it is also known that some subclasses of groupoids can only recognize regular languages. For example, loops recognize exactly the regular open languages and Beaudry et al. described the largest class of groupoids known to recognize only regular languages.
A groupoid H is said to be conservative if a·b is in { a, b } for all a, b in H. The main result of this paper is that conservative groupoids can only recognize regular languages. This class is incomparable with the one of Beaudry et al. so we are exhibiting a new sense in which a groupoid can be too weak to have context-free capabilities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrei, S., Cavadini, S., Chin, W.N.: Transforming self-embedded context-free grammars into regular expressions. Tech. Rep. TR 02-06, University “A.I.Cuza” of Iaşi, Faculty of Computer Science (2002)
Andrei, S., Chin, W.N., Cavadini, S.V.: Self-embedded context-free grammars with regular counterparts. Acta Inf. 40(5), 349–365 (2004)
Beaudry, M.: Languages recognized by finite aperiodic groupoids. Theor. Comput. Sci. 209(1-2), 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)
Beaudry, M., Lemieux, F., Thérien, D.: Groupoids That Recognize Only Regular Languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 421–433. Springer, Heidelberg (2005)
Linz, P.: An Introduction to Formal Languages and Automata, 2nd edn. Jones and Bartlett Publishers, Inc., USA (1997)
Pin, J.E.: Syntactic semigroups. In: Handbook of Language Theory, ch. 10, vol. 1, pp. 679–746. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubé, D., Latendresse, M., Tesson, P. (2012). Conservative Groupoids Recognize Only Regular Languages. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-28332-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28331-4
Online ISBN: 978-3-642-28332-1
eBook Packages: Computer ScienceComputer Science (R0)