François Lemieux  Home/Search
Context Related
| wwwdim.uqac.uquebec.ca/~f...these.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: wwwdim.uqac.uquebe...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In our Master thesis the notions of recognition by semigroups and by programs over semigroups were extended to groupoids. As a consequence of this transformation, we obtained context-free languages instead of regular with recognition by groupoids, and we obtained SAC 1 instead of NC 1 with recognition by programs over groupoids. In this thesis, we continue the investigation of the computational power of finite groupoids. We consider different restrictions on the original model. We examine... (Update)
Similar documents based on text: More All
0.5: Foliation Groupoids and Their Cyclic Homology - Crainic, Moerdijk (Correct)
0.5: Etale Groupoids, Derived Categories, and Operations. - Moerdijk (Correct)
0.5: Groupoids: Unifying Internal and External Symmetry - A Tour.. - Weinstein (1996) (Correct)
BibTeX entry: (Update)
F. Lemieux. Finite Groupoids and their Applications to Computational Complexity. PhD thesis, McGill University, 1996. http://citeseer.ist.psu.edu/lemieux96finite.html More
@misc{ lemieux96finite,
author = "F. Lemieux",
title = "Finite Groupoids and their Applications to Computational Complexity",
text = "F. Lemieux. Finite Groupoids and their Applications to Computational Complexity.
PhD thesis, McGill University, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/lemieux96finite.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
327 Languages and Machines (context) - Eilenberg - 1976
197 Transduction and Context-free languages (context) - Berstel - 1979
189 Algebraic methods in the theory of lower bounds for Boolean .. (context) - Smolensky - 1987
168 A Taxonomy of Problems with Fast Parallel Algorithms (context) - Cook - 1985
167 Structural Complexity (context) - Balc'azar, D'iaz et al. - 1988
126 Computers and Intractability: A Guide to the NP-Completeness (context) - Garey, Johson - 1979
125 On uniform circuit complexity (context) - Ruzzo - 1981
114 Bounded-Width Polynomial-Size Branching Programs Recognize E.. (context) - Barrington - 1989
92 Constant Depth Reducibility (context) - Chandra, Stockmeyer et al. - 1984
82 Semigroups and combinatorial applications (context) - Lallement - 1979
82 Sigma 1 1 -formulae on finite structures (context) - Ajtai - 1983
82 The theory of groups (context) - Hall - 1959
77 Threshold circuits of bounded depth (context) - Hajnal, Maass et al. - 1987
70 The boolean formula value problem is in ALOGTIME - Buss - 1987
[Article contains additional citations not shown here]
Documents on the same site (http://wwwdim.uqac.uquebec.ca/~flemieux/publications.html): More
Finite Loops Recognize Exactly the Regular Open Languages - Beaudry, Lemieux.. (1997) (Correct)
Circuits and Expressions with Non-Associative Gates - Moore, Thérien.. (Correct)
Polyabelian loops and Boolean completeness - Lemieux, Moore, Thérien (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC