Average complexity of partial derivatives for synchronised shuffle expressions
From MaRDI portal
Publication:6199867
DOI10.1007/978-3-031-40247-0_7MaRDI QIDQ6199867FDOQ6199867
Authors: Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis 
Publication date: 28 February 2024
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Cites Work
- Analytic combinatorics
- Partial derivatives of regular expressions and finite automaton constructions
- Title not available (Why is that?)
- From Mirkin's prebases to Antimirov's word partial derivatives
- Automata for regular expressions with shuffle
- On the average size of Glushkov and partial derivative automata
- On the average state complexity of partial derivative transducers
- Derivatives and partial derivatives for regular shuffle expressions
- On the average complexity of partial derivative automata for semi-extended expressions
- Synchronized shuffles
- Location automata for synchronised shuffle expressions
This page was built for publication: Average complexity of partial derivatives for synchronised shuffle expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199867)
