Abstract
This chapter discusses the algebras as tree automata. The classical algebra is studied as tree automata and in particular as recognizer of frontier languages. The tree automata are defined on universal algebras and the definition by which trees are simply polynomial symbols is adopted. The common use of nullary operators as terminal symbols is not very natural here. Any algebra can serve as a recognizer for an arbitrary alphabet without any need to adjoin new nullary operations to it. The existence of nullary operations has a certain effect on the recognition capability of the algebra. It is shown that exactly the context-free languages are recognizable by the finite tree automata. A vocabulary is a finite nonempty set of symbols and a sentence over a vocabulary W is a string of symbols from W. The empty sentence containing no symbols is denoted by e.
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.
