1 citations · 2 across the 3 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2021
Directing Words of Fuzzy Finite Automata
Magnus Steinby
A deterministic finite automaton is directable if it has a directing word which takes the automaton from every state to the same state. These notions have been extended also to oth…
cs.FL2019★ 1 cited
Fuzzy Deterministic Top-down Tree Automata
Eija Jurvanen, Magnus Steinby
In this paper we introduce and study fuzzy deterministic top-down (DT) tree automata over a lattice L. The L-fuzzy tree languages recognized by these automata are said to be DT-rec…
cs.FL2017★ 1 cited
Directable Fuzzy and Nondeterministic Automata
Magnus Steinby
We study three notions of directability of fuzzy automata akin to the D1-, D2- and D3-directability of nondeterministic automata. Thus an input word of a fuzzy automaton is D1-…