From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
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
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Hopcroft's Algorithm and Cyclic Automata
Language and Automata Theory and Applications
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
Bisimilarity Minimization in O(m logn) Time
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
On Extremal Cases of Hopcroft's Algorithm
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
On extremal cases of Hopcroft's algorithm
Theoretical Computer Science
Subsequential transducers: a coalgebraic perspective
Information and Computation
The average complexity of Moore's state minimization algorithm is O(n log log n)
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Construction of minimal deterministic finite automata from biological motifs
Theoretical Computer Science
Fast brief practical DFA minimization
Information Processing Letters
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
On the complexity of hopcroft’s state minimization algorithm
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
A graph theoretic approach to automata minimality
Theoretical Computer Science
Simple O(m log n) time Markov chain lumping
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Probabilistic Arithmetic Automata and Their Applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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 | 5.24 |