Compact representations of automata for regular expression matching
type: Item
instance of: scholarly article
title: Compact representations of automata for regular expression matching
zbMATH Open document ID: 1371.68169
author: Meng Zhang
author: Yi Zhang
author: Chen Hou
published in: Information Processing Letters
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6617214
zbMATH Keywords: algorithms
zbMATH Keywords: string matching
zbMATH Keywords: regular expressions
MaRDI profile type: Publication
full work available at URL: j.ipl.2016.07.003
OpenAlex ID: W2481495589
cites work: A Unified Construction of the Glushkov, Follow, and Antimirov Automata
cites work: Partial derivatives of regular expressions and finite automaton constructions
cites work: From regular expressions to deterministic automata
cites work: New Algorithms for Regular Expression Matching
cites work: Fast and compact regular expression matching
cites work: Faster Regular Expression Matching
cites work: Q5417708
cites work: Compact and fast algorithms for safe regular expression search
cites work: Perfect hashing
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: Algorithms on Strings, Trees and Sequences
cites work: Follow automata.
cites work: Q4057549
cites work: A Four Russians algorithm for regular expression pattern matching
cites work: New techniques for regular expression searching
cites work: Programming Techniques: Regular expression search algorithm
DOI: 10.1016/J.IPL.2016.07.003
description: scientific article; zbMATH DE number 6617214