Abstract
We introduce and study stochastic treeautomata generalizing in the framework of trees the well known stochastic string automata. We prove that events induced by such automata constitute a convex subset of the space of all tree events as well as that stochastic events are closed under composition with tree homomor-phisms. Moreover, it is shown that a stochastic treelanguage determined by an isolated cutpoint is actually recognizable.
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 callSimilar Papers
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.
