نتایج جستجو برای: fuzzy tree automata

تعداد نتایج: 278462  

2004
Mikolaj Bojanczyk Thomas Colcombet

Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is shown that deterministic tree-walking automata are weaker than nondeterministic tree-walking automata.

2016
Toni Dietze

Encoding unranked trees to binary trees, henceforth called binarization, is an important method to deal with unranked trees. For each of three binarizations we show that weighted (ranked) tree automata together with the binarization are equivalent to weighted unranked tree automata; even in the probabilistic case. This allows to easily adapt training methods for weighted (ranked) tree automata ...

Journal: :journal of advances in computer research 2014
nahid ebrahimi meymand aliakbar gharaveisi

anti-lock braking system (abs) is a nonlinear and time varying system including uncertainty, so it cannot be controlled by classic methods. intelligent methods such as fuzzy controller are used in this area extensively; however traditional fuzzy controller using simple type-1 fuzzy sets may not be robust enough to overcome uncertainties. for this reason an interval type-2 fuzzy controller is de...

2011
Manfred Schmidt-Schauß Susanne Albers

Connections between Tree Automata and Term Rewriting are now well known. Whereas treeautomata can be viewed as a subclass of ground rewrite systems, tree automata are successfullyused as decision tools in rewriting theory. Furthermore, applications, including rewriting theory,have influenced the definition of new classes of tree automata. In this talk, we will first presenta sho...

2011
Sophie Tison

Connections between Tree Automata and Term Rewriting are now well known. Whereas tree automata can be viewed as a subclass of ground rewrite systems, tree automata are successfully used as decision tools in rewriting theory. Furthermore, applications, including rewriting theory, have influenced the definition of new classes of tree automata. In this talk, we will first present a short and not e...

Journal: :Theory of computing systems 2021

Abstract We show the decidability of finite sequentiality problem for unambiguous max-plus tree automata. A automaton is called if there at most one accepting run on every tree. The asks whether a given automaton, exist finitely many deterministic automata whose pointwise maximum equivalent to automaton.

1997
Leonardo Maria Reyneri

This paper introduces Fuzzy State Automata for control applications. They are derived from the integration of traditional nite state automata and neuro-fuzzy systems, where a nite state automaton tracks the state of the plant under control and modiies the characteristic of the neuro-fuzzy system accordingly. The main diierence with respect to existing systems is that the states of the automata ...

2016
Erik Paul

We consider finite and polynomial ambiguity of weighted tree automata. Concerning finite ambiguity, we show that a finitely ambiguous weighted tree automaton can be decomposed into a sum of unambiguous automata. For polynomial ambiguity, we show how to decompose a polynomially ambiguous weighted tree automaton into simpler polynomially ambiguous automata and then analyze the structure of these ...

Journal: :Soft Computing 2022

Abstract Fuzzy multiset finite automata with output represent fuzzy version of (with output) working over multisets. This paper introduces Mealy-like, Moore-like, and compact automata. Their mutual transformations are described to prove their equivalent behaviours. Furthermore, various variants reduced studied where the reductions directed decrease number components (like initial distribution, ...

1996
Orna Kupferman Shmuel Safra

I n the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's) it was known that deterministic Biichi word automata are less expressive than nondeterministic Biichi word automata. The proof is easy and can be stated in a few lines. I n the late 60's) Rabin ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید