Abstract
In this article we generalize concepts of the position automaton and ZPC-structure to the regular [Formula: see text]-expressions. We show that the extended ZPC-structure can be built in linear time w.r.t. the size of the [Formula: see text]-expression and that the associated position automaton can be deduced from it in quadratic time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date
