Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
Authors
Abstract:
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a deterministic fuzzy automaton acceptance conditions on fuzzy ω-languages and fuzzy n-local automaton. The relationship between deterministic fuzzy n-local automaton and two subclasses of fuzzy regular ω-languages are established and proved that every fuzzy ω-language accepted by a deterministic fuzzy automaton in 2-mode is a projection of a Buchi fuzzy 2-local ω-language.
similar resources
Deterministic Fuzzy Automata on Fuzzy Regular ω-Languages
In this paper, the concept of fuzzy local ω-language, Büchi fuzzy local ω-language are studied and we give some closure properties of fuzzy local ω-languages. We also establish relationship between deterministic fuzzy local automaton and fuzzy local ω-language. Further we show that every fuzzy regular ω-language is a projection of a Büchi fuzzy local ω-language.
full textOn fuzzy multiset regular languages
The purpose of present work is to study some algebraic aspect of fuzzy multiset regular languages. In between, we show the equivalence of multiset regular language and fuzzy multiset regular language. Finally, we introduce the concept of pumping lemma for fuzzy multiset regular languages, which we use to establish a necessary and sufficient condition for a fuzzy multiset language to be non-cons...
full textTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
full textDeterministic finite H-Automata and ω-regular partial languages
Partial words, that is, finite words with holes, were introduced in the 70s by Fischer and Paterson, with respect to bioinformatics applications. Infinite partial words were introduced later. Recently, Dassow et al.’s connected partial words and regular languages. In this paper, we extend the local partial languages to local ω-partial languages and study their closure properties. We introduce t...
full textRegular splicing languages and subclasses
Recent developments in the theory of finite splicing systems have revealed surprising connections between long-standing notions in the formal language theory and splicing operation. More precisely, the syntactic monoid and Schützenberger constant have strong interaction with the investigation of regular splicing languages. This paper surveys results of structural characterization of classes of ...
full textLanguages vs . ω - Languages in Regular Infinite
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes K of regular languages of finite words (called ∗-languages), using natural transformations of ∗-langua...
full textMy Resources
Journal title
volume 14 issue 1
pages 1- 11
publication date 2019-04
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023