Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. M. Ajtai, Σ
1
1
formulae on finite structures, Annals of Pure and Applied Logic
24 (1983), 1–48.
2. D. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC
1, J. Comp, Syst. Sci., 38 (1989), 150–164.
3. J. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Math. Logik Grundlagen Math.
6, (1960), 66–92.
4. D. Barrington, K. Compton, H. Straubing, and D. Thérien, Regular languages in NC
1, to appear in J. Comp. Syst. Sci.
5. D. Barrington, N. Immerman and H. Straubing, On uniformity in NC
1, J. Comp. Syst. Sci., 41 (1990), 274–306.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献