Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A time hierarchy theorem for the LOCAL model | 2019 | |||
An exponential separation between randomized and deterministic complexity in the local model | 2019 | |||
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata | Theory of Computing Systems |
| 13 | 2014 |
Descriptional and computational complexity of finite automata—A survey | Information and Computation |
| 49 | 2011 |
Unary finite automata vs. arithmetic progressions | Information Processing Letters |
| 14 | 2009 |