نتایج جستجو برای: fuzzy finite automata
تعداد نتایج: 362011 فیلتر نتایج به سال:
Infinite behaviors of several kinds of finite automata on infinite objects are studied. Namely, alternating finite automata on r0-words, finite tree automata on infinite trees which move from the root infinitely, and finite biautomata on two-sided infinite words are investigated through six types of acceptance conditions. Each condition is an appropriate extension of the one used for acceptance...
In this paper we deal with 1-way multihead finite automata, in which the symbol under only one head (called read head) controls its move and other heads cannot distinguish the input symbols, they can only distinguish the end-marker from the other input symbols and they are called the blind head. We call such automaton a partially blind multihead automaton. We prove that partially blind k + 1-he...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید