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

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

Journal: :Information Processing Letters 2006

In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.

Journal: :Theor. Comput. Sci. 2013
Tullio Ceccherini-Silberstein Michel Coornaert Francesca Fiorenzi Zoran Sunic

We study the sofic tree shifts of A ∗ , where Σ∗ is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X ⊂ A ∗ is a sofic tree shift, then the configurations in X whose orbit under the shift action is finite are dense in X , and, as a consequence of this, we deduce that every injective cellular automata τ ...

Journal: :Acta Cybern. 2008
Lorand Muzamel

Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for pebble automata with “strong pebble handling” which means that pebbles can be lifted independently of the position of the reading head and withou...

Journal: :Annals of Pure and Applied Logic 2006

2005
Hitoshi Ohsaki Jean-Marc Talbot Sophie Tison Yves Roos

We consider several questions about monotone AC-tree automata, a class of equational tree automata [21] whose transition rules correspond to rules in Kuroda normal form of context-sensitive grammars. Whereas it is known that this class has a decision procedure to determine if a given monotone AC-tree automaton accepts no term [23], other decidability and complexity results have not been well-in...

Journal: :Information and Computation 2009

Journal: :International Journal of Foundations of Computer Science 2009

2005
F. Jacquemard M. Rusinowitch L. Vigneron Florent Jacquemard Michael Rusinowitch Laurent Vigneron

This paper presents new classes of tree automata combining automata with equality test with automata modulo equational theories. These tree automata are obtained by extending their standard Horn clause representations with equational conditions and monadic rewrite systems. We show in particular that the general membership problem is decidable by proving that the saturation of tree automata pres...

2005
Christopher Bone Suzana Dragicevic

Cellular automata (CA) are discrete systems used for modelling complex spatial dynamic phenomena. The discrete nature of CA enables integration with rasterbased geospatial datasets in geographic information systems (GIS), and also can be beneficial when modelling complex ecological processes that evolve over time. However, when modelling forest insect infestations it is difficult to use discret...

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

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