Open Access
Strong γ-Syncronization in Fuzzy Automata
Reads0
Chats0
TLDR
In this paper strongγ- synchronized automata is introduced and algorithm is given to find the strong γ- synchronized word for a fuzzy automata.Abstract:
In this paper strongγ- synchronized automata is introduced and algorithm is given to find the strong γ- synchronized word for a fuzzy automata.read more
References
More filters
Book
Fuzzy Automata and Languages: Theory and Applications
TL;DR: The Algebraic Approach to Relationships Between Languages and Automata and the Fuzzy Subsets revealed that the relationships between languages and automata were largely driven by deterministic and non-deterministic influences.
Journal ArticleDOI
Equivalence of topological Markov shifts
TL;DR: In this paper, it was shown that any two topological Markov shifts both of whose topological entropy equals logn (for somen) are equivalent by a finitistic coding.
Journal ArticleDOI
A note on synchronized automata and road coloring problem
TL;DR: A relabeling method is introduced which can be used for a large class of automata to improve their 'degree of synchronization' and allows, for example, to formulate the conjecture in several equivalent ways.
Book ChapterDOI
A Note on Synchronized Automata and Road Coloring Problem
TL;DR: A relabeling method is introduced which can be used for a large class of automata to improve their "degree of synchronization" and allows, for example, to formulate the Road Coloring Conjecture in several equivalent ways.