Prefix and Right-Partial Derivative Automata

@inproceedings{Maia2015PrefixAR,
  title={Prefix and Right-Partial Derivative Automata},
  author={Eva Maia and Nelma Moreira and Rog{\'e}rio Reis},
  booktitle={CiE},
  year={2015}
}
Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to non-deterministic finite automata (NFA) based on the Thompson ε-NFA (AT). The AT automaton has two quotients discussed: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating ε-transitions in AT, the Glushkov automaton (Apos) is obtained. Thus, it is easy to see that Asuf and the partial derivative automaton (Apd) are the same. In this paper, we characterise the Apre automaton as a… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Similar Papers

Loading similar papers…