Circuits and context-free languages

Authors:
Pierre McKenzie;Klaus Reinhardt;V. Vinay
Affiliations:
Informatique et recherche opérationnelle, Universitéde Montréal, Montréal, Québec, Canada;Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Tübingen, Germany;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 14
Cited 0

Parallel RAMs with owned global memory and deterministic contex-free language recognition

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Properties that characterize LOGCFL

Journal of Computer and System Sciences
Extensions to Barrington's M-program model

Theoretical Computer Science - Special issue on structure in complexity theory
Fast recognition of deterministic cfl's with a smaller number of processors

Theoretical Computer Science
Non-commutative arithmetic circuits: depth reduction and size lower bounds

Theoretical Computer Science
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Hierarchies over the Context-Free Languages

Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Strict Sequential P-completeness

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Advocating Ownership

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Hierarchies of Circuit Classes that are Closed Under Complement

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Two way deterministic pushdown automaton languages and some open problems in the theory of computation

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
The descriptive complexity approach to LOGCFL

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

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.