From regular expression matching to parsing

DOI10.1007/s00236-022-00420-6OpenAlexW4220711886MaRDI QIDQ2089747

Inge Li Gørtz, Philip Bille

Publication date: 24 October 2022

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-022-00420-6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Efficiently building a parse tree from a regular expression
• Fast and compact regular expression matching
• Bit-coded Regular Expression Parsing
• THE ABSTRACT THEORY OF AUTOMATA
• New Algorithms for Regular Expression Matching
• Faster Regular Expression Matching
• A linear space algorithm for computing maximal common subsequences
• A Four Russians algorithm for regular expression pattern matching
• From Regular Expression Matching to Parsing
• Automata, Languages and Programming
• Programming Techniques: Regular expression search algorithm

This page was built for publication: From regular expression matching to parsing