Partial derivative automaton by compressing regular expressions
From MaRDI portal
Publication:2096587
DOI10.1007/978-3-030-93489-7_9OpenAlexW4205833112MaRDI QIDQ2096587
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, António Machiavelo
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93489-7_9
Related Items (2)
Manipulation of regular expressions using derivatives: an overview ⋮ Location automata for regular expressions with shuffle and intersection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Fast equation automaton computation
- Regular expressions into finite automata
- Canonical derivatives, partial derivatives and finite automaton constructions.
- On the size of partial derivatives and the word membership problem
- ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH
- Simplifying Regular Expressions
- On the Average Size of Glushkov’s Automata
- Variations on the Common Subexpression Problem
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- On Average Behaviour of Regular Expressions in Strong Star Normal Form
- Algorithms on Strings
This page was built for publication: Partial derivative automaton by compressing regular expressions
