Boolean products of languages
From MaRDI portal
Cites work
- A mesh of automata
- Average complexity of partial derivatives for synchronised shuffle expressions
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Derivatives and partial derivatives for regular shuffle expressions
- Follow automata.
- Location automata for regular expressions with shuffle and intersection
- Location automata for synchronised shuffle expressions
- Location based automata for expressions with shuffle
- Partial derivatives of regular expressions and finite automaton constructions
- Reducing NFAs by invariant equivalences.
- Regular expressions into finite automata
- Relations between equation automata and follow automata
- Simplifying regular expressions. A quantitative perspective
- Synchronized shuffle on backbones
- Synchronized shuffles
- Three Partition Refinement Algorithms
This page was built for publication: Boolean products of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443162)