no. 4-6
Finite idempotent groupoids and regular languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 4-6, pp. 127-140. 
@article{ITA_1998__32_4-6_127_0,
     author = {Beaudry, M.},
     title = {Finite idempotent groupoids and regular languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {127--140},
     publisher = {EDP-Sciences},
     volume = {32},
     number = {4-6},
     year = {1998},
     mrnumber = {1672715},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1998__32_4-6_127_0/}
}
TY  - JOUR
AU  - Beaudry, M.
TI  - Finite idempotent groupoids and regular languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1998
SP  - 127
EP  - 140
VL  - 32
IS  - 4-6
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1998__32_4-6_127_0/
LA  - en
ID  - ITA_1998__32_4-6_127_0
ER  - 
%0 Journal Article
%A Beaudry, M.
%T Finite idempotent groupoids and regular languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1998
%P 127-140
%V 32
%N 4-6
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1998__32_4-6_127_0/
%G en
%F ITA_1998__32_4-6_127_0
Beaudry, M. Finite idempotent groupoids and regular languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 4-6, pp. 127-140. http://www.numdam.org/item/ITA_1998__32_4-6_127_0/

1. M. Beaudry, Characterization of idempotent monoids, Information Processing Letters, 1989, 31, pp. 163-166. | MR | Zbl

2. M. Beaudry, Languages recognized by finite aperiodic groupoids, Proc. 13th STACS, LNCS, 1996, 1046, pp. 113-124. | MR

3. F. Bédard, F. Lemieux and P. Mckenzie, Extensions to Barrington's M-program model, Theor. Comp. Sc., 1993, 107, pp. 31-61. | MR | Zbl

4. M. Beaudry, F. Lemieux and D. Thérien , Finite loops recognize exactly the regular open languages, Proc. 24th ICALP, LNCS 1256, 1997, pp. 110-120. | MR

5. R. H. Bruck, "A survey of binary Systems", Springer-Verlag, 1966. | MR | Zbl

6. H. Caussinus, Un groupoïde permettant de caractériser SAC1, Manuscript, 1993.

7. H. Caussinus, Contributions à l'étude du non-déterminisme restreint, thèse de doctorat, Université de Montréal, Montréal, 1996.

8. H. Caussinus and F. Lemieux, The Complexity of Computing over Quasigroups, Proc. FST & TCS, 1994, pp. 36-47. | MR | Zbl

9. S. Eilenberg, "Automata, Languages and Machines, Vol. B", Academic Press, 1976. | MR | Zbl

10. F. Gécseg and M. Steinby, "Tree Automata", Akadémiai Kiadó, Budapest, 1984. | MR | Zbl

11. S. Greibach, The Hardest Context-Free Language, SIAM J. Comp., 1973, 2, pp. 304-310. | MR | Zbl

12. G. Lallement, "Semigroups and Combinatorial Applications", Addison-Wesley, 1979. | MR | Zbl

13. R. Mcnaughton, Parenthesis Grammars, J. ACM, 1967, 14, pp. 490-500. | MR | Zbl

14. A. Muscholl, Characterizations of LOG, LOGDCFL and NP based on groupoid programs, Manuscript, 1992.

15. J.-É. Pin, "Variétés de langages formels", Masson, 1984. | MR | Zbl

16. M. Steinby, A theory of tree language varieties, in Tree Automata and Languages, M. NIVAT and A. PODELSKI Eds., North-Holland, 1992, pp. 57-82. | MR | Zbl

17. W. Thomas, Logical aspects in the study of tree languages, in 9th Coll. on Trees in Algebra and Programming, B. COURCELLE Ed., Cambridge University Press, 1984, pp. 31-51. | MR | Zbl

18. T. Wilke, Algebras for classifying regular tree languages and an application to frontier testability, Proc. 20th ICALP, LNCS, 1993, 700, pp. 347-358.