Space-efficient representations for Glushkov automata

DOI10.1142/S0129054118500223MaRDI QIDQ5384522zbMATH OpenOpenAlexFDO

Authors Meng Zhang, Yi 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

automatonstring matchingregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Compact representations of automata for regular expression matching
• New techniques for regular expression searching
• scientific article; zbMATH DE number 1848391
• An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
• Characterization of Glushkov automata

Cites work

• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• A Four Russians algorithm for regular expression pattern matching
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata
• Algorithms on Strings, Trees and Sequences
• Compact representations of automata for regular expression matching
• Fast and compact regular expression matching
• Faster Regular Expression Matching
• Follow automata.
• From regular expressions to deterministic automata
• New Algorithms for Regular Expression Matching
• New techniques for regular expression searching
• Partial derivatives of regular expressions and finite automaton constructions
• Programming Techniques: Regular expression search algorithm
• Regular expression matching with multi-strings and intervals
• THE ABSTRACT THEORY OF AUTOMATA
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds

Cited in

(1)

• Compact representations of automata for regular expression matching

This page was built for publication: Space-efficient representations for Glushkov automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384522)