Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Descriptional and computational complexity of finite automata—A survey | Information and Computation |
| 49 | 2011 |
Two-variable logic on data words | ACM Transactions on Computational Logic |
| 37 | 2011 |
On notions of regularity for data languages | Theoretical Computer Science |
| 12 | 2010 |
Tree-Walking Automata Do Not Recognize All Regular Languages | SIAM Journal on Computing |
| 9 | 2008 |
Tree-walking automata cannot be determinized | Theoretical Computer Science |
| 10 | 2006 |