2012
DOI: 10.5120/8980-2785
|View full text |Cite
|
Sign up to set email alerts
|

A Note on Fuzzy Tree Automata

Abstract: The aim of this note is to introduce fuzzy tree automaton over ranked alphabet(with and without -rules). In addition, we discuss completeness and reduction of fuzzy tree automata. Finally, we discuss closure properties of fuzzy tree languages.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?