A Unified Construction of the Glushkov, Follow, and Antimirov Automata
From MaRDI portal
Publication:5756696
DOI10.1007/11821069_10zbMath1132.68434OpenAlexW1501213188MaRDI QIDQ5756696
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_10
Related Items (16)
Nominal Kleene Coalgebra ⋮ Derived-Term Automata for Extended Weighted Rational Expressions ⋮ Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source ⋮ From Ambiguous Regular Expressions to Deterministic Parsing Automata ⋮ The net automaton of a rational expression ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Space-Efficient Representations for Glushkov Automata ⋮ A mesh of automata ⋮ A deterministic parsing algorithm for ambiguous regular expressions ⋮ Fault-tolerant computation of distributed regular path queries ⋮ Compact representations of automata for regular expression matching ⋮ Derived-Term Automata of Multitape Rational Expressions ⋮ Automata and rational expressions ⋮ Descriptional complexity of regular languages ⋮ Computing with relational machines ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
This page was built for publication: A Unified Construction of the Glushkov, Follow, and Antimirov Automata
