13 citations · 15 across the 5 of their papers we have counts for
5 papers
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…
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…
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-…
Varieties of Unranked Tree Languages
Magnus Steinby, Eija Jurvanen, Antonio Cano
We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used fo…
Tree Automata
Ferenc Gécseg, Magnus Steinby
This is a reissue of the book Tree Automata by F. Gécseg and M. Steinby originally published in 1984 by Akadémiai Kiadó, Budapest. Some mistakes have been corrected and a few obscu…