NC1: The automata-theoretic viewpoint-Reference-Cited by-同舟云学术

NC1: The automata-theoretic viewpoint

Published:1991-12 Issue:4 Volume:1 Page:330-359
ISSN:1016-3328
Container-title:Computational Complexity
language:en
Short-container-title:Comput Complexity

Author:

McKenzie Pierre,P�ladeau Pierre,Therien Denis

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01212963.pdf

Reference49 articles.

1. M. Ajtai, ? 1 1 formulae on finite structures,Ann. Pure and Applied Logic 24 (1983), 1?48.

2. D. A. M. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages inNC 1,J. Computer and Systems Science 38 (1989), 150?164.

3. D. A. M. Barrington, K. Compton, H. Straubing, and D. Thérien, Regular languages inNC 1, Boston College Technical Report TR-BCCS-88-02, 1988, to appear inJ. Computer and Systems Science.

4. D. A. M. Barrington, N. Immerman, andH. Straubing, On uniformity withinNC 1,J. Computer and Systems Science 41 (1990), 274?306.

5. D. A. M. Barrington and H. Straubing, Linear-size bounded-width branching programs, Boston College Tech. Rep. BCCS 90-11, October 1990.

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity of Spherical Equations in Finite Groups;Lecture Notes in Computer Science;2024

2. Tameness and the power of programs over monoids in DA;Logical Methods in Computer Science;2022-08-02

3. CC-circuits and the expressive power of nilpotent algebras;Logical Methods in Computer Science;2022-05-26

4. On the Computational Power of Programs over $$\mathsf {BA}_2$$ Monoid;Language and Automata Theory and Applications;2021

5. The Power of Programs over Monoids in J;Language and Automata Theory and Applications;2020