Compact representations of automata for regular expression matching

DOI10.1016/J.IPL.2016.07.003zbMath1371.68169OpenAlexW2481495589MaRDI QIDQ738883

Yi Zhang, Meng Zhang, Chen Hou

Publication date: 16 August 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.07.003

zbMATH Keywords

algorithmsregular expressionsstring matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Space-Efficient Representations for Glushkov Automata

Cites Work

• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• Perfect hashing
• Follow automata.
• New techniques for regular expression searching
• Fast and compact regular expression matching
• THE ABSTRACT THEORY OF AUTOMATA
• New Algorithms for Regular Expression Matching
• Faster Regular Expression Matching
• Algorithms on Strings, Trees and Sequences
• A Four Russians algorithm for regular expression pattern matching
• Compact and fast algorithms for safe regular expression search
• Programming Techniques: Regular expression search algorithm
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata

This page was built for publication: Compact representations of automata for regular expression matching