Proof of a conjecture of R. Kannan
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A categorical framework for finite state machines
Mathematical Structures in Computer Science
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |