FAdo
From MaRDI portal
Cited in
(27)- Incremental DFA minimisation
- On the size of partial derivatives and the word membership problem
- A type system for weighted automata and rational expressions
- On the Average Number of States of Partial Derivative Automata
- Regular expressions and transducers over alphabet-invariant and user-defined labels
- Deciding regular expressions (in-)equivalence in Coq
- Grail
- LANGAGE
- OpenFst
- TkWinHOL
- Vaucanson
- LASER
- KAT-ML
- GUItar
- PDCoq
- DiskPaxos
- Implementation of code properties via transducers
- Symbolic manipulation of code properties
- SoftRegex
- On average behaviour of regular expressions in strong star normal form
- Deciding Kleene algebra terms equivalence in Coq
- Applying data refinement for monadic programs to Hopcroft's algorithm
- On the average complexity of partial derivative transducers
- Theoretical and implementational aspects of the formal language server (LaSer)
- Randomized generation of error control codes with automata and transducers
- Automata for regular expressions with shuffle
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
This page was built for software: FAdo
