Abstract
We introduce deterministic top-down tree languages with Boolean deterministic look-ahead. We show that the class of deterministic top-down tree languages with deterministic top-down look-ahead and the class of Boolean deterministic tree languages are incomparable under the inclusion relation, and that the union of these two tree language classes is a proper subclass of the class of deterministic top-down tree languages with Boolean deterministic look-ahead, which is a proper subclass of the regular tree languages. We give an inclusion diagram for the above mentioned five tree language classes plus the class of deterministic top-down tree languages. We also show that both the class of deterministic top-down tree languages with deterministic top-down look-ahead and the class of deterministic top-down tree languages with Boolean deterministic look-ahead are closed under binary intersection.
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.
