On the state complexity of partial derivative automata for regular expressions with intersection
From MaRDI portal
Publication:2829969
DOI10.1007/978-3-319-41114-9_4zbMATH Open1476.68125OpenAlexW2494167956MaRDI QIDQ2829969FDOQ2829969
Authors: Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis 
Publication date: 9 November 2016
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01633952/file/416473_1_En_4_Chapter.pdf
Recommendations
- On the average complexity of partial derivative automata for semi-extended expressions
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- Partial derivatives of an extended regular expression
- On the Average Number of States of Partial Derivative Automata
- Partial Derivative Automaton for Regular Expressions with Shuffle
Cites Work
- Analytic combinatorics
- Derivatives of Regular Expressions
- Partial derivatives of regular expressions and finite automaton constructions
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Succinctness of the complement and intersection of regular expressions
- A note on the space complexity of some decision problems for finite automata
- Succinctness of regular expressions with interleaving, intersection and counting
- Rewriting extended regular expressions
- Partial derivatives of an extended regular expression
- Title not available (Why is that?)
- From Mirkin's prebases to Antimirov's word partial derivatives
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- On the average size of Glushkov and partial derivative automata
- A general framework for the derivation of regular expressions
- Partial Derivative Automaton for Regular Expressions with Shuffle
Cited In (8)
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- On the Average Number of States of Partial Derivative Automata
- On the average state complexity of partial derivative transducers
- Partial Derivative Automaton for Regular Expressions with Shuffle
- On the average complexity of partial derivative automata for semi-extended expressions
- Position automaton construction for regular expressions with intersection
- On average behaviour of regular expressions in strong star normal form
- Partial derivatives of an extended regular expression
Uses Software
This page was built for publication: On the state complexity of partial derivative automata for regular expressions with intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829969)
