Space-Economical Construction of Index Structures for All Suffixes of a String
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Automata and Binary Decision Diagrams
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
The Minimum DAWG for All Suffixes of a String and Its Applications
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Optimal insertion in deterministic DAWGs
Theoretical Computer Science
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
Finite-state transducers in language and speech processing
Computational Linguistics
Ternary directed acyclic word graphs
Theoretical Computer Science - Implementation and application of automata
Incremental construction of compact acyclic NFAs
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Parsing with a finite dictionary
Theoretical Computer Science - The art of theory
Exact enumeration of acyclic deterministic automata
Discrete Applied Mathematics
An automata-theoretic approach to the word problem for ω -terms over R
Theoretical Computer Science
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters
Fast equation automaton computation
Journal of Discrete Algorithms
Hopcroft's Algorithm and Cyclic Automata
Language and Automata Theory and Applications
Reformulating Global Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
General suffix automaton construction algorithm and space bounds
Theoretical Computer Science
Longest common subsequence as private search
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Exact enumeration of acyclic deterministic automata
Discrete Applied Mathematics
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
A lexicon-based stemming procedure
PROPOR'03 Proceedings of the 6th international conference on Computational processing of the Portuguese language
Ternary directed acyclic word graphs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Efficient and robust music identification with weighted finite-state transducers
IEEE Transactions on Audio, Speech, and Language Processing
Towards the optimal minimization of a pronunciation dictionary model
TSD'10 Proceedings of the 13th international conference on Text, speech and dialogue
A challenging family of automata for classical minimization algorithms
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Random generation of deterministic acyclic automata using Markov chains
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
An automata approach to pattern collections
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
Complexity of operations on cofinite languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Sampling different kinds of acyclic automata using Markov chains
Theoretical Computer Science
An efficient linear pseudo-minimization algorithm for aho-corasick automata
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Cycle-aware minimization of acyclic deterministic finite-state automata
Discrete Applied Mathematics
| Hi-index | 0.01 |