نتایج جستجو برای: fuzzy tree automata
تعداد نتایج: 278462 فیلتر نتایج به سال:
Here we study the notions of lattice-valued finite state machine and lattice-valued fuzzy transformation semigroup when the lattice consists of all the closed subintervals contained in [0, 1]. So, we can apply techniques of interval-valued fuzzy sets to fuzzy automata. In particular, we prove that Atanassov’s Kα operators allow us to retrieve the information given by the transition functions of...
The purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. This is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.
This work presents a machine-checked tree automata library for Standard-ML, OCaml and Haskell. The algorithms are efficient by using appropriate data structures like RB-trees. The available algorithms for non-deterministic automata include membership query, reduction, intersection, union, and emptiness check with computation of a witness for non-emptiness. The executable algorithms are derived ...
This survey reports results on the ambiguity of nite tree automata, the valuedness of bottom{up nite state tree transducers and boundedness of cost automata. 0 Introduction Ambiguity, valuedness and maximal cost are diierent measures on the behaviour of nite state devices. The ambiguity of an automaton is the least upper bound on the number of diierent accepting computations for a given input. ...
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, re...
Trees are one of the fundamental data structures used in Computer Science. We present a new kind of acyclic pushdown automata, the tree pattern pushdown automaton and the nonlinear tree pattern pushdown automaton, constructed for an ordered tree. These automata accept all tree patterns and nonlinear tree patterns, respectively, which match the tree and represent a full index of the tree for suc...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید