The prefix automaton
From MaRDI portal
Recommendations
Cites work
- A mesh of automata
- Analytic combinatorics
- Automata for regular expressions with shuffle
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Follow automata.
- From Mirkin's prebases to Antimirov's word partial derivatives
- scientific article; zbMATH DE number 3549966 (Why is no real title available?)
- On the average complexity of partial derivative automata for semi-extended expressions
- 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 derivatives of regular expressions and finite automaton constructions
- Position automata for semi-extended expressions
- Position automaton construction for regular expressions with intersection
- Prefix and Right-Partial Derivative Automata
- Programming Techniques: Regular expression search algorithm
- THE ABSTRACT THEORY OF AUTOMATA
Cited in
(8)- Manipulation of regular expressions using derivatives: an overview
- A mesh of automata
- On the mother of all automata: the position automaton
- Computing the prefix of an automaton
- Regular prefix relations
- Location automata for regular expressions with shuffle and intersection
- Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
- Compressed structures for partial derivative automata constructions
This page was built for publication: The prefix automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5061515)
