Cited in
(20)- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- Incremental DFA minimisation
- Applying data refinement for monadic programs to Hopcroft's algorithm
- On the Average Number of States of Partial Derivative Automata
- Implementation of code properties via transducers
- Grail
- LANGAGE
- OpenFst
- TkWinHOL
- Vaucanson
- KAT-ML
- FAdo
- PDCoq
- Regular Sets
- DiskPaxos
- SoftRegex
- A type system for weighted automata and rational expressions
- Deciding Kleene algebra terms equivalence in Coq
- Randomized generation of error control codes with automata and transducers
- Deciding regular expressions (in-)equivalence in Coq
This page was built for software: GUItar
