Determinization of glushkov automata

摘要

We establish a new upper bound on the number of states of the automation yielded by the determinizatio of a Glushkov automation. We show that the ZPC structure, which is an implicit construction for Glushkov automata, leads to an efficient implementation of the subset construction.