EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 32 / No 4-6 (1998) RAIRO-Theor. Inf. Appl., 32 4-6 (1998) 127-140 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 32, Number 4-6, 1998
Page(s) 127 - 140
DOI https://doi.org/10.1051/ita/1998324-601271
Published online 01 February 2017
  1. 1. M. BEAUDRY, Characterization of idempotent monoids, Information Processing Letters, 1989, 31, pp. 163-166. [MR: 998466] [Zbl: 0671.68025] [Google Scholar]
  2. 2. M. BEAUDRY, Languages recognized by finite aperiodic groupoids, Proc. 13th STACS, LNCS, 1996, 1046, pp. 113-124. [MR: 1462090] [Google Scholar]
  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. [MR: 1201164] [Zbl: 0764.68040] [Google Scholar]
  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. [MR: 1616178] [Google Scholar]
  5. 5. R. H. BRUCK, "A survey of binary Systems", Springer-Verlag, 1966. [MR: 93552] [Zbl: 0141.01401] [Google Scholar]
  6. 6. H. CAUSSINUS, Un groupoïde permettant de caractériser SAC1, Manuscript, 1993. [Google Scholar]
  7. 7. H. CAUSSINUS, Contributions à l'étude du non-déterminisme restreint, thèse de doctorat, Université de Montréal, Montréal, 1996. [Google Scholar]
  8. 8. H. CAUSSINUS and F. LEMIEUX, The Complexity of Computing over Quasigroups, Proc. FST & TCS, 1994, pp. 36-47. [MR: 1318016] [Zbl: 1044.68679] [Google Scholar]
  9. 9. S. EILENBERG, "Automata, Languages and Machines, Vol. B", Academic Press, 1976. [MR: 530383] [Zbl: 0359.94067] [Google Scholar]
  10. 10. F. GÉCSEG and M. STEINBY, "Tree Automata", Akadémiai Kiadó, Budapest, 1984. [MR: 735615] [Zbl: 0537.68056] [Google Scholar]
  11. 11. S. GREIBACH, The Hardest Context-Free Language, SIAM J. Comp., 1973, 2, pp. 304-310. [MR: 334591] [Zbl: 0278.68073] [Google Scholar]
  12. 12. G. LALLEMENT, "Semigroups and Combinatorial Applications", Addison-Wesley, 1979. [MR: 530552] [Zbl: 0421.20025] [Google Scholar]
  13. 13. R. MCNAUGHTON, Parenthesis Grammars, J. ACM, 1967, 14, pp. 490-500. [MR: 234781] [Zbl: 0168.01206] [Google Scholar]
  14. 14. A. MUSCHOLL, Characterizations of LOG, LOGDCFL and NP based on groupoid programs, Manuscript, 1992. [Google Scholar]
  15. 15. J.-É. PIN, "Variétés de langages formels", Masson, 1984. [MR: 752695] [Zbl: 0636.68093] [Google Scholar]
  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. [MR: 1196732] [Zbl: 0798.68087] [Google Scholar]
  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. [MR: 787450] [Zbl: 0557.68051] [Google Scholar]
  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. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.