From regular expression matching to parsing
type: Item
instance of: scholarly article
title: From regular expression matching to parsing
author: Philip Bille
author: Inge Li Gørtz
published in: Acta Informatica
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7605997
MaRDI profile type: Publication
full work available at URL: s00236-022-00420-6
OpenAlex ID: W4220711886
cites work: Q3525697
cites work: New Algorithms for Regular Expression Matching
cites work: Fast and compact regular expression matching
cites work: From Regular Expression Matching to Parsing
cites work: Faster Regular Expression Matching
cites work: Q5417708
cites work: Efficiently building a parse tree from a regular expression
cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths
cites work: Automata, Languages and Programming
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Q5536277
cites work: A Four Russians algorithm for regular expression pattern matching
cites work: Bit-coded Regular Expression Parsing
cites work: Programming Techniques: Regular expression search algorithm
DOI: 10.1007/S00236-022-00420-6
description: scientific article; zbMATH DE number 7605997