Title: The Equivalence Between Tree Automata and Context-Free Tree Grammars with Membership Values in Lattice-Ordered Monoids
Abstract: In this paper,the definitions of fuzzy tree automata and fuzzy context-free tree grammars are extended to a more general lattice-ordered monoid.It is shown that they are equivalent in the sense of accepting and generating languages.Meanwhile,a method to construct a normalized form for a lattice-valued context-free tree grammar is presented.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot