Determinization of transducers over finite and infinite words
Theoretical Computer Science
Minimizing subsequential transducers: a survey
Theoretical Computer Science
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Algorithmic Aspects of Speech Recognition: A Synopsis
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Near real-time suffix tree construction via the fringe marked ancestor problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
| Hi-index | 5.23 |