Skip to main content
Conference Proceedings

Determinization of glushkov automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1660 57-68
DOI: 10.1007/3-540-48057-9_5
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Champarnaud, J. M., Ziadi, D., & Ponty, J. L. (1999). Determinization of glushkov automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1660, pp. 57–68). Springer Verlag. https://doi.org/10.1007/3-540-48057-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free