Languages Recognized by Finite Aperiodic Groupoids - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Martin Beaudry. Languages Recognized by Finite Aperiodic Groupoids. In Claude Puech, Rüdiger Reischuk, editors, STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Volume 1046 of Lecture Notes in Computer Science, pages 113-124, Springer, 1996.

The following publications are possibly variants of this publication:

Languages Recognized by Finite Aperiodic GroupoidsMartin Beaudry. TCS, 209(1-2):299-317, 1998. [doi]

Groupoids That Recognize Only Regular LanguagesMartin Beaudry, François Lemieux, Denis Thérien. icalp 2005: 421-433 [doi]

Finite idempotent groupoids and regular languagesMartin Beaudry. ita, 32(4-6):127-140, 1998. [doi]

Conservative groupoids recognize only regular languagesMartin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson. iandc, 239:13-28, 2014. [doi]

runs on WebDSL