Languages recognized by finite aperiodic groupoids
We study the context-free languages recognized by a groupoid G in terms of the algebraic properties of the multiplication monoid M(G) of G. Concentrating on the case where M(G) is group-free, we show that all regular languages can be recognized by groupoids for which M(G) is J-trivial and that all groupoids for which M(G) belongs to the larger variety DA recognize only regular languages. Further, we give an example of a groupoid such that M(G) is in the smallest variety outside of DA, and which recognizes all context-free languages not containing the empty word.
KeywordsRegular Language Finite Automaton Empty Word Nondeterministic Finite Automaton Syntactic Monoid
Unable to display preview. Download preview PDF.
- M. Beaudry, P. McKenzie and D. Thérien, The membership problem in aperiodic transformation monoids, J. of the Association for Computing Machinery39 (1992), pp. 599–616.Google Scholar
- F. Bédard, F. Lemieux and P. McKenzie, Extensions to Barrington's M-program model, Theoretical Computer Science (Algorithms, automata, complexity and games)107 (1993), pp. 31–61.Google Scholar
- H.Caussinus and F.Lemieux, The Complexity of Computing over Quasigroups, Proc. FST& TCS (1994), pp. 36–47.Google Scholar
- J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).Google Scholar
- G. Lallement, Semigroups and Combinatorial Applications, Addison-Wesley (1979).Google Scholar
- H. Pflugfelder, Quasigroups and Loops: Introduction, Heldermann (1990).Google Scholar
- J.-E. Pin, Variétés de langages formels, Masson (1984).Google Scholar
- J. Stern, Complexity of some problems from the theory of automata, Information and Computation66 (1985), pp. 163–176.Google Scholar