]. D. Bar89 and . Barrington, Bounded-width polynomial size branching programs recognize exactly those languages in NC 1, Bovet and P. Crescenzi. Introduction to the Theory of Complexity. International Series in Computer Science, pp.150-164, 1989.

P. [. Bovet, R. Crescenzi, and . Silvestri, A uniform approach to define complexity classes, Theoretical Computer Science, vol.104, issue.2, pp.263-283, 1992.
DOI : 10.1016/0304-3975(92)90125-Y

J. L. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I. Texts in Theoretical Computer Science, 1995.

N. [. Mix-barrington, H. Immerman, and . Straubing, On uniformity within NC1, Journal of Computer and System Sciences, vol.41, issue.3, pp.274-306, 1990.
DOI : 10.1016/0022-0000(90)90022-D

J. [. Cai and . Chen, On input read-modes of alternating Turing machines, Theoretical Computer Science, vol.148, issue.1, pp.33-55, 1995.
DOI : 10.1016/0304-3975(94)00253-F

D. [. Chandra, L. J. Kozen, and . Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

H. Caussinus, P. Mckenzie, D. Thérien, and H. Vollmer, Nondeterministic NC/sup 1/ computation, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory), pp.200-212, 1998.
DOI : 10.1109/CCC.1996.507664

]. U. Her92 and . Hertrampf, Locally definable acceptance types for polynomial time machines, Proceedings 9th Symposium on Theoretical Aspects of Computer Science, pp.199-207, 1992.

]. U. Her94 and . Hertrampf, Complexity classes defined via k-valued functions, Proceedings 9th Structure in Complexity Theory, pp.224-234, 1994.

. Hls-+-93-]-u, C. Hertrampf, T. Lautemann, H. Schwentick, K. W. Vollmer et al., On the power of polynomial time bit-reductions, Proceedings 8th Structure in Complexity Theory, pp.200-207, 1993.

J. [. Hopcroft and . Ullman, Introduction to Automata Theory, Languages, and Computation . Addison-Wesley Series in Computer Science, 1979.

B. Jenner, P. Mckenzie, and D. Thérien, Logspace and logtime leaf languages, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, pp.21-33, 1996.
DOI : 10.1109/SCT.1994.315799

]. C. Pap94 and . Papadimitriou, Computational Complexity Handbook of Formal Languages, volume I, 1994.

H. [. Regan and . Vollmer, Gap-languages and log-time complexity classes, Theoretical Computer Science, vol.188, issue.1-2, pp.101-116, 1997.
DOI : 10.1016/S0304-3975(96)00288-5

]. M. Sip83 and . Sipser, Borel sets and circuit complexity, Proceedings of the 15th Symposium on Theory of Computing, pp.61-69, 1983.

]. N. Ver93 and . Vereshchagin, Relativizable and non-relativizable theorems in the polynomial theory of algorithms, Izvestija Rossijskoj Akademii Nauk, vol.57, pp.51-90, 1993.

]. S. Yu97 and . Yu, Regular languages, Handbook of Formal Languages, pp.41-110, 1997.