Non-uniform automata over groups
- 1 December 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 89 (2) , 109-132
- https://doi.org/10.1016/0890-5401(90)90007-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Finite monoids and the fine structure of NC 1Journal of the ACM, 1988
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1986
- Bounded-depth, polynomial-size circuits for symmetric functionsTheoretical Computer Science, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Classification of finite monoids: the language approachTheoretical Computer Science, 1981
- Families of recognizable sets corresponding to certain varieties of finite monoidsJournal of Pure and Applied Algebra, 1979
- On finite monoids having only trivial subgroupsInformation and Control, 1965