An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Piecewise and Local Threshold Testability of DFA
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
A tight linear bound on the synchronization delay of bijective automata
Theoretical Computer Science
Brief communication: Identification of all trinucleotide circular codes
Computational Biology and Chemistry
A classification of 20-trinucleotide circular codes
Information and Computation
Computing forbidden words of regular languages
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 5.23 |