Disambiguation in regular expression matching via position automata with augmented transitions
From MaRDI portal
Publication:3073642
DOI10.1007/978-3-642-18098-9_25zbMATH Open1297.68160OpenAlexW1506336181MaRDI QIDQ3073642FDOQ3073642
Authors: Satoshi Okui, Taro Suzuki
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_25
Recommendations
- New Algorithms for Regular Expression Matching
- scientific article; zbMATH DE number 5717242
- Formalising and implementing Boost POSIX regular expression matching
- Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
- Efficient testing and matching of deterministic regular expressions
Cites Work
Cited In (9)
- Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
- Formalising and implementing Boost POSIX regular expression matching
- Formalising Boost POSIX regular expression matching
- POSIX lexing with derivatives of regular expressions
- Regular expressions at their best: a case for rational design
- A deterministic parsing algorithm for ambiguous regular expressions
- The inclusion problem for regular expressions
- \textit{BSP}: a parsing tool for ambiguous regular expressions
- From ambiguous regular expressions to deterministic parsing automata
This page was built for publication: Disambiguation in regular expression matching via position automata with augmented transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073642)