Abstract
Champarnaud et al., and Khorsi et al. show how to compute the equation automaton of a word regular expression [Formula: see text] via the C-continuations. Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression [Formula: see text] over a ranked alphabet [Formula: see text] and produce a [Formula: see text] time and space complexity algorithm, where [Formula: see text] is the maximal rank of a symbol occurring in [Formula: see text] and [Formula: see text] is the size of the syntax tree of [Formula: see text]. In this paper, we give a full description of an algorithm based on the acyclic minimization of Revuz in order to compute the pseudo-continuations from the C-continuations. Our algorithm, which is performed in [Formula: see text] time and space complexity, where [Formula: see text] is the number of states of the produced automaton, is more efficient than the one obtained by Kuske and Meinecke since [Formula: see text]. Moreover, our algorithm is an output-sensitive algorithm, i.e. the complexity of which is based on the size of the produced automaton.
Sign-in/Register to access full text options 
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
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
