Details

Autor(en) / Beteiligte

• Allauzen, Cyril
• Mohri, Mehryar
• Urzyczyn, Paweł
• Královič, Rastislav

Titel

A Unified Construction of the Glushkov, Follow, and Antimirov Automata

Ist Teil von

• Lecture notes in computer science, 2006, p.110-121

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2006

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• A number of different techniques have been introduced in the last few decades to create ε-free automata representing regular expressions such as the Glushkov automata, follow automata, or Antimirov automata. This paper presents a simple and unified view of all these construction methods both for unweighted and weighted regular expressions. It describes simpler algorithms with time complexities at least as favorable as that of the best previously known techniques, and provides a concise proof of their correctness. Our algorithms are all based on two standard automata operations: epsilon-removal and minimization. This contrasts with the multitude of complicated and special-purpose techniques previously described in the literature, and makes it straightforward to generalize these algorithms to the weighted case. In particular, we extend the definition and construction of follow automata to the case of weighted regular expressions over a closed semiring and present the first algorithm to compute weighted Antimirov automata.