Star-free open languages and aperiodic loops

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

Volumn 2010, Issue , 2001, Pages 87-98

  Beaudry, Martin ^a   Lemieux, François ^b   Thérien, Denis ^c  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN DECOMPOSITION METHODS; STARS;

BINARY OPERATIONS; CLOSURE PROPERTY; DECOMPOSITION THEOREMS; FINITE SET; GROUP TOPOLOGIES; NEUTRAL ELEMENTS; OPEN LANGUAGES; WREATH PRODUCTS;

CONTEXT FREE LANGUAGES;

EID: 84957103313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_8     Document Type: Conference Paper

References (29)

1. M Ajtai, Σ11-formulae on finite structures, Annals of Pure and Applied Logic, 24 pp.1-48, 1983.
2. A.A. Albert, Quasigroups. I, Trans. Amer. Math. Soc., Vol. 54 (1943) pp.507-519.
3. A.A. Albert, Quasigroups. II, Trans. Amer. Math. Soc., Vol. 55 (1944) pp.401-419.
4. D.A. Barrington, Bounded-Width Polynomial-Size Branching Programs Recognize Exactly those Languages in NC1, JCSS 38, 1 (1989), pp. 150-164.
5. D. Barrington and D. Thérien, Finite Monoids and the Fine Structure of NC1, JACM 35, 4 (1988), pp. 941-952.
6. P.W. Beam, S.A. Cook, and H.J. Hoover, Log Depth Circuits for Division and Related Problems, in Proc. of the 25th IEEE Symp. on the Foundations of Computer Science (1984), pp. 1-6.
7. M. Beaudry, Languages recognized by finite aperiodic groupoids, Theoretical Computer Science, vol. 209, 1998, pp. 299-317.
8. M. Beaudry, Finite idempotent groupoids and regular languages, Theoretical Informatics and Applications, vol. 32, 1998, pp. 127-140.
9. M. Beaudry, F. Lemieux, and D. Thérien, Finite loops recognize exactly the regular open languages, in Proc. of the 24th International Colloquium on Automata, Languages and Programming, Springer Lecture Notes in Comp. Sci. 1256 (1997), pp. 110-120.
10. F. Bédard, F. Lemieux and P. McKenzie, Extensions to Barrington's M-program model, TCS 107 (1993), pp. 31-61.
11. R.H. Bruck, Contributions to the Theory of Loops, Trans. AMS, (60) 1946 pp.245-354.
12. R.H. Bruck, A Survey of Binary Systems, Springer-Verlag, 1966.
13. H. Caussinus and F. Lemieux, The Complexity of Computing over Quasigroups, In the Proceedings of the 14th annual FST&TCS Conference, LNCS 1256, Springer-Verlag 1994, pp.36-47.
14. O. Chein, H.O. Pfugfelder, and J.D.H. Smith, Quasigroups and Loops: Theory and Applications, Helderman Verlag Berlin, 1990.
15. S.A. Cook, A Taxonomy of Problems with Fast Parallel Algorithms, Information and Computation 64 (1985), pp. 2-22.
16. S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. B, (1976).
17. M.L. Furst, J.B. Saxe and M. Sipser, Parity, Circuits, and the Polynomial-Time Hierarchy, Proc. of the 22nd IEEE Symp. on the Foundations of Computer Science (1981), pp. 260-270. Journal version Math. Systems Theory 17 (1984), pp. 13-27.
18. F. Lemieux, Complexité, langages hors-contextes et structures algebriques non-associatives, Masters Thesis, Université de Montréal, 1990.
19. F. Lemieux, Finite Groupoids and their Applications to Computational Complexity, Ph.D. Thesis, McGill University, May 1996.
20. C. Moore, F. Lemieux, D. Thérien, J. Berman, and A. Drisko, Circuits and Expressions with Nonassociative Gates, JCSS 60 (2000) pp.368-394.
21. A. Muscholl, Characterizations of LOG, LOGDCFL and NP based on groupoid programs, Manuscript, 1992.
22. H.O. Pfugfelder, Quasigroups and Loops: Introduction, Heldermann Verlag, 1990.
23. J.-E. Pin, Variétés de languages formels, Masson (1984). Also Varieties of Formal Languages, Plenum Press, New York, 1986.
24. J.-E. Pin, On Reversible Automata, in Proceedings of the first LATIN Conference, Sao-Paulo, Notes in Computer Science 583, Springer Verlag, 1992, 401-416.
25. J.-E. Pin, Polynomial closure of group languages and open set of the Hall topology, Theoretical Computer Science 169 (1996) 185-200.
26. J.E. Savage, The complexity of computing, Wiley, 1976.
27. M.P. Schützenberger, On Finite Monoids having only trivial subgroups, Information and Control 8 (1965), pp. 190-194.
28. I. Simon, Piecewise testable Events, Proc. 2nd GI Conf., LNCS 33, Springer, pp. 214-222, 1975.
29. H. Venkateswaran, Circuit definitions of nondeterministic complexity classes, Proceedings of the 8th annual FST&TCS Conference, 1988.