Finite idempotent groupoids and regular languages

M. Beaudry

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1998)

  • Volume: 32, Issue: 4-6, page 127-140
  • ISSN: 0988-3754

How to cite

top

Beaudry, M.. "Finite idempotent groupoids and regular languages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 32.4-6 (1998): 127-140. <http://eudml.org/doc/92582>.

@article{Beaudry1998,
author = {Beaudry, M.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {4-6},
pages = {127-140},
publisher = {EDP-Sciences},
title = {Finite idempotent groupoids and regular languages},
url = {http://eudml.org/doc/92582},
volume = {32},
year = {1998},
}

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
PB - EDP-Sciences
VL - 32
IS - 4-6
SP - 127
EP - 140
LA - eng
UR - http://eudml.org/doc/92582
ER -

References

top
  1. 1. M. BEAUDRY, Characterization of idempotent monoids, Information Processing Letters, 1989, 31, pp. 163-166. Zbl0671.68025MR998466
  2. 2. M. BEAUDRY, Languages recognized by finite aperiodic groupoids, Proc. 13th STACS, LNCS, 1996, 1046, pp. 113-124. MR1462090
  3. 3. F. BÉDARD, F. LEMIEUX and P. MCKENZIE, Extensions to Barrington's M-program model, Theor. Comp. Sc., 1993, 107, pp. 31-61. Zbl0764.68040MR1201164
  4. 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. MR1616178
  5. 5. R. H. BRUCK, "A survey of binary Systems", Springer-Verlag, 1966. Zbl0141.01401MR93552
  6. 6. H. CAUSSINUS, Un groupoïde permettant de caractériser SAC1, Manuscript, 1993. 
  7. 7. H. CAUSSINUS, Contributions à l'étude du non-déterminisme restreint, thèse de doctorat, Université de Montréal, Montréal, 1996. 
  8. 8. H. CAUSSINUS and F. LEMIEUX, The Complexity of Computing over Quasigroups, Proc. FST & TCS, 1994, pp. 36-47. Zbl1044.68679MR1318016
  9. 9. S. EILENBERG, "Automata, Languages and Machines, Vol. B", Academic Press, 1976. Zbl0359.94067MR530383
  10. 10. F. GÉCSEG and M. STEINBY, "Tree Automata", Akadémiai Kiadó, Budapest, 1984. Zbl0537.68056MR735615
  11. 11. S. GREIBACH, The Hardest Context-Free Language, SIAM J. Comp., 1973, 2, pp. 304-310. Zbl0278.68073MR334591
  12. 12. G. LALLEMENT, "Semigroups and Combinatorial Applications", Addison-Wesley, 1979. Zbl0421.20025MR530552
  13. 13. R. MCNAUGHTON, Parenthesis Grammars, J. ACM, 1967, 14, pp. 490-500. Zbl0168.01206MR234781
  14. 14. A. MUSCHOLL, Characterizations of LOG, LOGDCFL and NP based on groupoid programs, Manuscript, 1992. 
  15. 15. J.-É. PIN, "Variétés de langages formels", Masson, 1984. Zbl0636.68093MR752695
  16. 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. Zbl0798.68087MR1196732
  17. 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. Zbl0557.68051MR787450
  18. 18. T. WILKE, Algebras for classifying regular tree languages and an application to frontier testability, Proc. 20th ICALP, LNCS, 1993, 700, pp. 347-358. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.