Abstract
Classes of Y-trees are defined so that closure properties hold for families of languages accepted by deterministic [or nondeterministic] systolic automata over a Y-tree T, called , if and, in some cases, only if the underlying Y-tree T is in the class. Results of the same type are proved also for decision problems. Moreover a new nonacceptability criterion for is given and used to prove some non closure properties.
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.
