Automata for regular expressions with shuffle
From MaRDI portal
Recommendations
- Partial Derivative Automaton for Regular Expressions with Shuffle
- On the Average Number of States of Partial Derivative Automata
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- On the average size of Glushkov and partial derivative automata
- On the State Complexity of the Shuffle of Regular Languages
Cites work
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Derivatives for regular shuffle expressions
- Derivatives of regular expressions and an application
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- From Mirkin's prebases to Antimirov's word partial derivatives
- From regular expressions to deterministic automata
- 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
- Succinctness of regular expressions with interleaving, intersection and counting
Cited in
(20)- Structural properties of shuffle automata
- The commutative closure of shuffle languages over group languages is regular
- Manipulation of regular expressions using derivatives: an overview
- Location based automata for expressions with shuffle
- Derivatives and partial derivatives for regular shuffle expressions
- Location automata for synchronised shuffle expressions
- On the average complexity of partial derivative transducers
- Derivatives for regular shuffle expressions
- On the average state complexity of partial derivative transducers
- The prefix automaton
- On the shuffle automaton size for words
- Partial Derivative Automaton for Regular Expressions with Shuffle
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- Location automata for regular expressions with shuffle and intersection
- Average complexity of partial derivatives for synchronised shuffle expressions
- Average state complexity of partial derivative automata for synchronised shuffles
- Two-word shuffle: some results
- Automata for synchronised shuffle on backbones
- Language quotients revisited
- Compressed structures for partial derivative automata constructions
This page was built for publication: Automata for regular expressions with shuffle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706150)
