Fast equation automaton computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Canonical derivatives, partial derivatives and finite automaton constructions.
- From Mirkin's prebases to Antimirov's word partial derivatives
- From regular expressions to DFA's using compressed NFA's
- Linear Automaton Transformations
- Minimisation of acyclic deterministic automata in linear time
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- The passing of a rational expression to a nondeterministic finite automaton
- Three Partition Refinement Algorithms
Cited in
(9)- Partial derivative automaton by compressing regular expressions
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- On the size of partial derivatives and the word membership problem
- Location automata for regular expressions with shuffle and intersection
- An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
- An efficient algorithm for the construction of the equation tree automaton
- scientific article; zbMATH DE number 1786456 (Why is no real title available?)
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- Manipulation of regular expressions using derivatives: an overview
This page was built for publication: Fast equation automaton computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018095)