Journal of the ACM (JACM)
Decision Procedures for Families of Deterministic Pushdown Automata
Decision Procedures for Families of Deterministic Pushdown Automata
Deterministic one-counter automata
Journal of Computer and System Sciences
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Note: On the separability of sparse context-free languages and of bounded rational relations
Theoretical Computer Science
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
More Concise Representation of Regular Languages by Automata and Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On recursive and non-recursive trade-offs between finite-turn pushdown automata
Journal of Automata, Languages and Combinatorics
Rational subsets of partially reversible monoids
Theoretical Computer Science
More concise representation of regular languages by automata and regular expressions
Information and Computation
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Simplifying DPDA using supplementary information
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the descriptional complexity of the window size for deterministic restarting automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.01 |