Abstract
Simpler proofs that DAuxPDA-TIME(polynomial) equals LOG(DCFL) and that SAC1 equals LOG(CFL) are given which avoid Sud-borough's multi-head automata [Sud78]. The first characterization of LOGDCFL in terms of polynomial proof-tree-size is obtained, using circuits built from the multiplex select gates of [FLR96]. The classes L and NC1 are also characterized by such polynomial size circuits: “self-similar” logarithmic depth captures L, and bounded width captures NC1.
Cite
CITATION STYLE
McKenzie, P., Reinhardt, K., & Vinay, V. (1999). Circuits and context-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1627, pp. 194–203). Springer Verlag. https://doi.org/10.1007/3-540-48686-0_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
