Abstract
The TQL logic (Tree Query Language) proposed by Cardelli and Ghelli [1] is a logical declarative language, allowing to express properties on the semistructured documents. By using TQL logic we can characterize certain languages of trees such as for example the regular languages with unboundarity. In this work, our objective is to enrich this logic in order to be able to express properties of the context-free tree languages, synchronized regular tree languages and synchronized context-free tree languages.
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.
