On the size of partial derivatives and the word membership problem
From MaRDI portal
Publication:2041687
DOI10.1007/s00236-021-00399-6OpenAlexW3183377724MaRDI QIDQ2041687
Rogério Reis, Nelma Moreira, Stavros Konstantinidis, António Machiavelo
Publication date: 23 July 2021
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-021-00399-6
Related Items (2)
Manipulation of regular expressions using derivatives: an overview ⋮ Partial derivative automaton by compressing regular expressions
Uses Software
Cites Work
- Partial derivatives of regular expressions and finite automaton constructions
- Fast equation automaton computation
- Regular expressions into finite automata
- A mesh of automata
- 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 State Complexity of Partial Derivative Transducers
- On the Average Size of Glushkov’s Automata
- Faster Regular Expression Matching
- A Four Russians algorithm for regular expression pattern matching
- 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
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- Programming Techniques: Regular expression search algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the size of partial derivatives and the word membership problem
