Formalising and implementing Boost POSIX regular expression matching
From MaRDI portal
Recommendations
- Formalising Boost POSIX regular expression matching
- Disambiguation in regular expression matching via position automata with augmented transitions
- POSIX regular expression parsing with derivatives
- On the semantics of regular expression parsing in the wild
- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
Cites work
- scientific article; zbMATH DE number 1456950 (Why is no real title available?)
- Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
- Automata, Languages and Programming
- Disambiguation in regular expression matching via position automata with augmented transitions
- Formalising Boost POSIX regular expression matching
- On the semantics of regular expression parsing in the wild
- One-unambiguous regular languages
- POSIX regular expression parsing with derivatives
- Programming Techniques: Regular expression search algorithm
- Symbolic finite state transducers: algorithms and applications
Cited in
(5)- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
- Formalising Boost POSIX regular expression matching
- POSIX lexing with derivatives of regular expressions
- Disambiguation in regular expression matching via position automata with augmented transitions
- POSIX regular expression parsing with derivatives
This page was built for publication: Formalising and implementing Boost POSIX regular expression matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220787)
