شماره ركورد كنفرانس :
4035
عنوان مقاله :
A REDUCTION ALGORITHM FOR FUZZY CODING TREE AUTOMATA
پديدآورندگان :
GHORANI MARYAM ghorani@shahroodut.ac.ir Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran
كليدواژه :
Fuzzy coding tree automata , Reduction algorithm , Complexity.
عنوان كنفرانس :
اولين دوره همايش بين المللي رياضيات فازي
چكيده فارسي :
This paper deals with fuzzy coding tree automata. At first, the existence of the reduced form of a fuzzy coding tree automaton is considered. Then, a reduction algorithm for fuzzy coding tree automata is proposed and its time complexity is obtained. Finally, a numerical example is provided to clarify the algorithm.
