Author:
Fijalkow Nathanaël,Paperman Charles
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1. Journal of Computer and System Sciences 38(1), 150–164 (1989)
2. Barrington, D.A.M., Compton, K., Straubing, H., Thérien, D.: Regular languages in NC1. Journal of Computer and System Sciences 44(3), 478–499 (1992)
3. Barrington, D.A.M., Immerman, N., Lautemann, C., Schweikardt, N., Thérien, D.: First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. Journal of Computer and System Sciences 70(2), 101–127 (2005)
4. Barrington, D.A.M., Thérien, D.: Finite monoids and the fine structure of NC1. Journal of the Association for Computing Machinery 35(4), 941–952 (1988)
5. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proceedings of the 1st International Congress of Logic, Methodology, and Philosophy of Science, CLMPS 1960, pp. 1–11. Stanford University Press (1962)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献