Author:
Beaudry Martin,Lemieux François,Thérien Denis
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Barrington, D., Thérien, D.: Finite Monoids and the Fine Structure of NC 1. J. ACM 35(4), 941–952 (1988)
2. Beaudry, M.: Languages recognized by finite aperiodic groupoids. TCS 209, 299–317 (1998)
3. Lecture Notes in Computer Science;M. Beaudry,1997
4. Caussinus, H., Lemieux, F.: The complexity of computing over quasigroups. In: Proc. 14th annual FST&TCS, pp. 36–47 (1994)
5. Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, London (1976)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献