Translating regular expression matching into transducers
From MaRDI portal
Publication:420836
DOI10.1016/j.jal.2011.11.003zbMath1238.68052OpenAlexW2031830821MaRDI QIDQ420836
Yasuhiko Minamide, Yuto Sakuma, Andrei Voronkov
Publication date: 23 May 2012
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2011.11.003
Related Items (6)
On the semantics of atomic subgroups in practical regular expressions ⋮ On the Semantics of Regular Expression Parsing in the Wild ⋮ Translating regular expression matching into transducers ⋮ Context-free grammars with lookahead ⋮ Automata-based symbolic string analysis for vulnerability detection ⋮ On the semantics of regular expression parsing in the wild
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Translating regular expression matching into transducers
- Minimization algorithms for sequential transducers
- Top-down tree transducers with regular look-ahead
- Comprehending monads
- A play on regular expressions
- Regular expression containment
- Automata, Languages and Programming
- Algebra and Coalgebra in Computer Science
- Two Complete Axiom Systems for the Algebra of Regular Events
- Programming Techniques: Regular expression search algorithm
This page was built for publication: Translating regular expression matching into transducers