Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
On the closure properties of linear conjunctive languages
Theoretical Computer Science
STOC '76 Proceedings of the eighth 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 recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
Information and Computation
On state-alternating context-free grammars
Theoretical Computer Science
On partially blind multihead finite automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
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
Information and Computation
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
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
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
| Hi-index | 0.01 |