Finite loops recognize exactly the regular open languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 110-120

  Beaudry, Martin ^a   Lemieux, François ^b   Therien, Denis ^b  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MONOIDS; OPEN LANGUAGES;

AUTOMATA THEORY;

EID: 84951017390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_169     Document Type: Conference Paper

References (26)

1. A. A. Albert, Quasigroups I, Trans. Amer. Math. Soc, 54 (1943) 507-519. Quasig-roups II, Trans. Amer. Math. Soc, 55 (1944) 401-419.
2. C. J. Ash, Inevitable sequences and a proof of the type II conjecture, Proc. of the Monash Conf. on Semigroup Theory, World Scientific, Singapore (1991) 31-42.
3. C.J. Ash, Inevitable graphs: a proof of the type II conjecture and some related decision procedures, Int. J. Alg. and Comp. 1 (1991) 127-146.
4. D. Barrington and D. Thérien, "Finite Monoids and the Fine Structure of NC1", JACM 354(1988)941-952
5. F. Bédard, F. Lemieux and P. McKenzie, Extensions to Barrington's M-program model, TCS 107 (1993), pp. 31-61.
6. J. Berman, A. Drisko, F. Lemieux, C. Moore, and D. Thérien, Circuits and Expressions with N on-Associative Gates, Submitted to 12th Annual Conference on Computational Complexity (CCC'97)
7. R.H. Bruck, Contributions to the Theory of Loops, Trans. AMS 60 (1946) 245-354.
8. R.H. Bruck, A Survey of Binary Systems, Springer-Verlag, 1966.
9. H. Caussinus and F. Lemieux, The complexity of computing over quasigroups, Proc. 14th annual FSTandTCS, 1994, pp.36-47.
10. S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
11. T. Evans, Embedding Incomplete Latin Squares, Amer. Math. Monthly, 67 pp. 958-961, 1960.
12. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiado, Budapest, 1984.
13. M. Hall Jr., A topology for free groups and related groups, Ann. of Maths 52 (1950) 127-139.
14. F. Lemieux, Finite groupoids and their applications to computational complexity, Ph.D. Thesis, McGill University, May 1996.
15. J. Mezei and J.B. Wright, Algebraic automata and context-free sets, Inform, and Contr. 11 (1967) 3-29.
16. J.-E. Pin, Varieties of Formal Languages, Plenum Press, New York, 1986.
17. J.-E. Pin, A topological approach to a conjecture of Rhodes, Bulletin of the Australian Mathematical Society 38 (1988) 421-431.
18. J.-E. Pin, Topologies for the free monoid, Journal of Algebra 137 (1991) 297-337.
19. J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, 21th ICALP, Springer-Verlag, LNCS 820, 1994, 424-435.
20. J.-E. Pin, BG = PG: A Success Story, Proc. of Intern. Conf. on Groups, Semigroups, and Formal Languages, York 1993, Kluwer Publisher.
21. C. Reutenauer, Une topologie du monoıde libre, Semigroup Forum 18 (1979), 3349.
22. C. Reutenauer, Sur mon article "Une topologie du mono'ide libre", Semigroup Forum 22 (1981), 93-95.
23. J. Rhodes and B. Tiison, The kernel of monoid morphisms, J. Pure and Applied Algebra 62 (1989) 227-268.
24. M.-P. Schiitzenberger On finite monoids having only trivial subgroups, Information and Control 8 (1965) 190-194.
25. D. Thérien, Two-sided wreath product of categories, J. Pure and Applied Algebra 74 (1991) 307-315.
26. L. G Valiant, General c\cubic time, J. Comput. System Sei. 10 (2) (1975) 308-315.