Skip to main content
SpringerLink
Log in

Languages recognized by finite aperiodic groupoids

Extended abstract

  • Conference paper
  • First Online:
STACS 96 (STACS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1046))

Included in the following conference series:

Abstract

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.

Work supported by NSERC grant OGP0089786 and FCAR grant 91-ER-0642, and done while on leave at the Lehrstuhl für theoretische Informatik, Universität Würzburg, and at the School of Computer Science, McGill University./Heading>

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. 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 

  3. H.Caussinus and F.Lemieux, The Complexity of Computing over Quasigroups, Proc. FST& TCS (1994), pp. 36–47.

    Google Scholar 

  4. S. Greibach, The Hardest Context-Free Language, SIAM J. on Computing2 (1973), pp. 304–310.

    Article  Google Scholar 

  5. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979).

    Google Scholar 

  6. G. Lallement, Semigroups and Combinatorial Applications, Addison-Wesley (1979).

    Google Scholar 

  7. H. Pflugfelder, Quasigroups and Loops: Introduction, Heldermann (1990).

    Google Scholar 

  8. J.-E. Pin, Variétés de langages formels, Masson (1984).

    Google Scholar 

  9. J. Stern, Complexity of some problems from the theory of automata, Information and Computation66 (1985), pp. 163–176.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de mathématiques et d'informatique, Université de Sherbrooke, J1K 2R1, Sherbrooke, Québec, Canada

    Martin Beaudry

Authors
  1. Martin Beaudry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Puech Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beaudry, M. (1996). Languages recognized by finite aperiodic groupoids. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-60922-9_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60922-3

  • Online ISBN: 978-3-540-49723-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation