Finite idempotent groupoids and regular languages

Authors
Beaudry, M
Citation
M. Beaudry, Finite idempotent groupoids and regular languages, RAIRO-INF, 32(4-6), 1998, pp. 127-140
Citations number
18
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS
ISSN journal
09883754 → ACNP
Volume
32
Issue
4-6
Year of publication
1998
Pages
127 - 140
Database
ISI
SICI code
0988-3754(199806/12)32:4-6<127:FIGARL>2.0.ZU;2-M
Abstract
We investigate the language-recognizing power of those finite groupoids who se multiplication monoid belongs to the variety A(1) of the idempotent mono ids. We find that they recognize a strict subset of the star-free languages . We also consider groupoids which always contain an identity (quasimonoids ); within this restriction, we show the existence of a chain of strict incl usions between the languages classes defined by specifying that the multipl ication monoid belongs to varieties J(1), R-1, and A(1). (C) Elsevier Paris .