Abstract
The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||E|| + 1) states for an expression of alphabetic width ||E||. In this paper this type of automata is extended to regular tree expressions and it is shown that the conversion of a regular tree expression of size |E| and alphabetic width ||E|| into its reduced tree automaton can be done in O(|E|·||E||) time. The time complexity of the algorithm proposed by Dietrich Kuske and Ingmar Meinecke is also proved in order to reach an O(||E||·|E|) time complexity for the problem of the construction of the equation automaton from a regular tree expression.
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 callDisclaimer: 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.
