Space-efficient representations for Glushkov automata

DOI10.1142/S0129054118500223zbMATH Open1415.68140OpenAlexW2901361485MaRDI QIDQ5384522FDOQ5384522

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

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

zbMATH Keywords

automatonstring matchingregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Algorithms on Strings, Trees and Sequences
• THE ABSTRACT THEORY OF AUTOMATA
• Title not available (Why is that?)
• Partial derivatives of regular expressions and finite automaton constructions
• Fast and compact regular expression matching
• Follow automata.
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata
• New techniques for regular expression searching
• Regular expression matching with multi-strings and intervals
• Programming Techniques: Regular expression search algorithm
• New Algorithms for Regular Expression Matching
• Faster Regular Expression Matching
• A Four Russians algorithm for regular expression pattern matching
• From regular expressions to deterministic automata
• Compact representations of automata for regular expression matching
• 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)