Abstract

A new type of syntactic monoid and semigroup of tree languages is introduced. For each n ≥ 1, we define for any tree language T its n-ary syntactic monoid Mn(T) and its n-ary syntactic semigroup Sn(T) as quotients of the monoid or semigroup, respectively, formed by certain new generalized contexts. For n = 1 these contexts are just the ordinary contexts (or 'special trees') and M1(T) is the syntactic monoid introduced by W. Thomas (1982,1984). Several properties of these monoids and semigroups are proved. For example, it is shown that Mn(T) and Sn(T) are isomorphic to certain monoids and semigroups associated with the minimal tree recognizer of T. Using these syntactic monoids or semigroups, we can associate with any variety of finite monoids or semigroups, respectively, a variety of tree languages. Although there are varieties of tree languages that cannot be obtained this way, we prove that the definite tree languages can be characterized by the syntactic semigroups S2(T), which is not possible using the classical syntactic monoids or semigroups.

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 call

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.