Formalising and implementing Boost POSIX regular expression matching (Q2220787): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2021.01.010
+Normal rank
@@ Property / OpenAlex ID @@
+W3118520292
@@ Property / OpenAlex ID: W3118520292 / rank @@
+Normal rank
@@ Property / cites work @@
+Formalising Boost POSIX regular expression matching
+Normal rank
@@ Property / cites work @@
+Derivative-Based Diagnosis of Regular Expression Ambiguity
+Normal rank
@@ Property / cites work @@
+Programming Techniques: Regular expression search algorithm
+Normal rank
@@ Property / cites work @@
+One-unambiguous regular languages
@@ Property / cites work: One-unambiguous regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
+Normal rank
@@ Property / cites work @@
+POSIX Regular Expression Parsing with Derivatives
@@ Property / cites work: POSIX Regular Expression Parsing with Derivatives / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954439
@@ Property / cites work: Q4954439 / rank @@
+Normal rank
@@ Property / cites work @@
+On the semantics of regular expression parsing in the wild
+Normal rank
@@ Property / cites work @@
+Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
+Normal rank
@@ Property / cites work @@
+Symbolic finite state transducers
@@ Property / cites work: Symbolic finite state transducers / rank @@
+Normal rank