Disambiguation in regular expression matching via position automata with augmented transitions

DOI10.1007/978-3-642-18098-9_25MaRDI QIDQ3073642zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

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

• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Automata, Languages and Programming
• Efficiently building a parse tree from a regular expression
• THE ABSTRACT THEORY OF AUTOMATA

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
• Regular expressions at their best: a case for rational design
• POSIX lexing with derivatives of regular expressions
• 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)