Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Path systems and language recognition
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Some properties of precedence languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Properties that characterize LOGCFL
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel RAMs with owned global memory and deterministic context-free language recognition
Journal of the ACM (JACM)
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
SIGACT news complexity theory column 35
ACM SIGACT News
Alternating and Empty Alternating Auxiliary Stack Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Arithmetic Circuits and Polynomial Replacement Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Multiple Pattern Matching Algorithms on Collage System
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
McNaughton families of languages
Theoretical Computer Science
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
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
Tree-size bounded alternation(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
On non-erasing oracle tapes in space bounded reducibility
ACM SIGACT News
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
The intractability of computing the Hamming distance
Theoretical Computer Science
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The descriptive complexity approach to LOGCFL
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Circuits and context-free languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Nodes connected by path languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The computational complexity of one-dimensional sandpiles
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Equivalence problems for circuits over sets of natural numbers
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.01 |