Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
Parallel RAMs with owned global memory and deterministic contex-free language recognition
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Parallel time O (log n) recognition of unambiguous context-free languages
Information and Computation
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Decompositions of nondeterministic reductions
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Some subclasses of context-free languages in NC1
Information Processing Letters
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
Characterizing unambiguous augmented pushdown automata by circuits
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Structure and importance of logspace-MOD-classes
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue on structure in complexity theory
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Context-Free Controlled ETOL Systems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Uniform Circuits and Exclusive Read PRAMs
Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science
Computational Calculus and Hardest Languages of Automata with Abstract Storages
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Unambiguity and Fewness for Logarithmic Space
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
On the Complexities of Linear LL(1) and LR(1) Grammars
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
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
Iterated pushdown automata and complexity classes
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Time-space trade-offs for general recursion
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Undirected connectivity in O(log/sup 1.5/n) space
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Complexity of recognition in intermediate Level languages
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The following survey reviews some connections between formal languages and complexity theory. Families of formal languages are treated with complexity theoretical methods. In particular, the concept of unambiguity, common to both areas, is treated in detail. Some complexity theoretical aspects of operations on formal languages are indicated. This picture is completed by taking parallel models into account.