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_4zbMath1476.68125OpenAlexW2494167956MaRDI QIDQ2829969
António Machiavelo, Sabine Broda, Rogério Reis, Rafaela Bastos, Nelma Moreira
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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Rewriting extended regular expressions
- Succinctness of regular expressions with interleaving, intersection and counting
- A note on the space complexity of some decision problems for finite automata
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- A general framework for the derivation of regular expressions
- ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH
- Partial Derivatives of an Extended Regular Expression
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- Partial Derivative Automaton for Regular Expressions with Shuffle
- Derivatives of Regular Expressions
This page was built for publication: On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
