The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Adding nesting structure to words
Journal of the ACM (JACM)
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
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
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity of operations on input-driven pushdown automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Streaming algorithms for some problems in log-space
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Trimming visibly pushdown automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Input-Driven queue automata: finite turns, decidability, and closure properties
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |