A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
A taxonomy of problems with fast parallel algorithms
Information and Control
Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
The complexity of languages generated by attribute grammars
SIAM Journal on Computing
Parallel RAMs with owned global memory and deterministic contex-free language recognition
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Path systems and language recognition
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Two dynamic programming algorithms for which interpreted pebbling helps
Information and Computation
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
| Hi-index | 0.00 |
Two properties, called semi-unboundedness, and polynomial proof-size, are identified as key properties shared by the definitions of LOGCFL on several models of computations. The semi-unboundedness property leads to the definition of new models of computation based on unbounded fan-in circuits. These are circuits obtained from unbounded fan-in circuits by restricting the fan-in of gates of one type. A new characterization of LOGCFL is obtained on such a model in which the fan-in of the AND gates are bounded by a constant. This property also suggests new characterizations of LOGCFL on the following models: alternating Turing machines [CKS81], nondeterministic auxiliary pushdown automata [Co71], and bounded fan-in Boolean circuits [Co85].