Prefix and Right-Partial Derivative Automata
From MaRDI portal
Recommendations
- Partial derivative and position bisimilarity automata
- Prefix pushdown automata and their simplification
- Partial derivatives of regular expressions and finite automata constructions
- Partial derivatives of regular expressions and finite automaton constructions
- Partial derivative automata formalized in Coq
- On the average complexity of partial derivative automata for semi-extended expressions
- Computing the prefix of an automaton
- Derived-term automata of multitape rational expressions
- Partial higher-dimensional automata
- Partial derivative automaton by compressing regular expressions
Cites work
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Follow automata.
- From Mirkin's prebases to Antimirov's word partial derivatives
- Left is better than right for reducing nondeterminism of NFAs
- On the average size of Glushkov and partial derivative automata
- On the Average Size of Glushkov’s Automata
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- Partial derivative and position bisimilarity automata
- Partial derivatives of regular expressions and finite automaton constructions
- Programming Techniques: Regular expression search algorithm
- THE ABSTRACT THEORY OF AUTOMATA
- Two-sided derivatives for regular expressions and for hairpin expressions
Cited in
(8)- Location based automata for expressions with shuffle
- A mesh of automata
- On the mother of all automata: the position automaton
- Computing the prefix of an automaton
- Partial derivative and position bisimilarity automata
- The prefix automaton
- Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
- Relations between equation automata and follow automata
This page was built for publication: Prefix and Right-Partial Derivative Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195704)
