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
Inferring Deterministic Linear Languages
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
McNaughton families of languages
Theoretical Computer Science
On the closure properties of linear conjunctive languages
Theoretical Computer Science
Degrees of non-monotonicity for restarting automata
Theoretical Computer Science
A Taxonomy of Deterministic Forgetting Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
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
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
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
Leaf languages and string compression
Information and Computation
Streaming algorithms for some problems in log-space
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Streaming algorithms for language recognition problems
Theoretical Computer Science
| Hi-index | 0.00 |