Abstract
In this article we generalize the concepts of position automaton and ZPC structure to the regular double-struck K sign-expressions. We show that the ZPC structure can be built in linear time in the size of the expression and that the associated position automaton can be deduced from it in quadratic time. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Champarnaud, J. M., Laugerotte, É., Ouardi, F., & Ziadi, D. (2003). From regular weighted expressions to finite automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759, 49–60. https://doi.org/10.1007/3-540-45089-0_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free