Space-Efficient Representations for Glushkov Automata

DOI10.1142/S0129054118500223zbMath1415.68140OpenAlexW2901361485MaRDI QIDQ5384522

Yi Zhang, Meng Zhang

Publication date: 24 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118500223

zbMATH Keywords

regular expressionsstring matchingautomaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• Compact representations of automata for regular expression matching
• 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
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds
• Programming Techniques: Regular expression search algorithm
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata

This page was built for publication: Space-Efficient Representations for Glushkov Automata