Non-uniform automata over groups
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 163-173
- https://doi.org/10.1007/3-540-18088-5_13
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Published by Association for Computing Machinery (ACM) ,1986
- Bounded-depth, polynomial-size circuits for symmetric functionsTheoretical Computer Science, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Bounds for width two branching programsPublished by Association for Computing Machinery (ACM) ,1983
- Unbounded fan-in circuits and associative functionsPublished by Association for Computing Machinery (ACM) ,1983
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- The dot-depth hierarchy of star-free languages is infiniteJournal of Computer and System Sciences, 1978
- Dot-depth of star-free eventsJournal of Computer and System Sciences, 1971