On the semantics of atomic subgroups in practical regular expressions

DOI10.1007/978-3-319-60134-2_2zbMath1489.68119OpenAlexW2618072102MaRDI QIDQ2399246

Bruce W. Watson, Martin Berglund, Nicolaas Weideman, Brink van der Merwe

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Re-examining regular expressions with backreferences ⋮ Memoized regular expressions

Uses Software

• PERL
• RegExLib

Cites Work

• Unnamed Item
• Unnamed Item
• Translating regular expression matching into transducers
• Descriptional and computational complexity of finite automata -- a survey
• On the semantics of regular expression parsing in the wild
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• Cuts in Regular Expressions

This page was built for publication: On the semantics of atomic subgroups in practical regular expressions