Translating regular expression matching into transducers
From MaRDI portal
Publication:420836
DOI10.1016/J.JAL.2011.11.003zbMATH Open1238.68052OpenAlexW2031830821MaRDI QIDQ420836FDOQ420836
Authors: Yuto Sakuma, Yasuhiko Minamide, 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
Recommendations
- scientific article; zbMATH DE number 1948484
- Regular expressions and transducers over alphabet-invariant and user-defined labels
- Regular expressions and transducers over alphabet-invariant and user-defined labels
- From regular expression matching to parsing
- From Regular Expression Matching to Parsing
- From two-way transducers to regular function expressions
- From two-way transducers to regular function expressions
- scientific article; zbMATH DE number 7318987
Cites Work
- Elements of automata theory. Translated from the French by Reuben Thomas
- Top-down tree transducers with regular look-ahead
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Complete Axiom Systems for the Algebra of Regular Events
- Comprehending monads
- Minimization algorithms for sequential transducers
- Translating regular expression matching into transducers
- A play on regular expressions: functional pearl
- Regular expression containment, coinductive axiomatization and computational interpretation
- Automata, Languages and Programming
- Algebra and Coalgebra in Computer Science
- Programming Techniques: Regular expression search algorithm
Cited In (13)
- DReX: a declarative language for efficiently evaluating regular string transformations
- Title not available (Why is that?)
- Translating regular expression matching into transducers
- Context-free grammars with lookahead
- On the semantics of atomic subgroups in practical regular expressions
- Regular expressions at their best: a case for rational design
- Proof-directed program transformation: a functional account of efficient regular expression matching
- On the semantics of regular expression parsing in the wild
- Using regular expressions in translation memories
- Title not available (Why is that?)
- On the semantics of regular expression parsing in the wild
- Automata-based symbolic string analysis for vulnerability detection
- Symbolic string transformations with regular lookahead and rollback
Uses Software
This page was built for publication: Translating regular expression matching into transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420836)