Fuzzy regular languages over finite and infinite words

Authors:
Werner Kuich;George Rahonis
Affiliations:
Institut für Algebra und Computermathematik, Technische Universität Wien, Wiedner Hauptstraße 8-10, A-1040 Wien, Austria;Department of Mathematics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
Venue:
Fuzzy Sets and Systems
Year:
2006

Citing 15
Cited 7

Semirings, automata, languages

Semirings, automata, languages
Formal languages

Formal languages
A formal power series approach to the construction of minimal fuzzy automata

Information Sciences: an International Journal
A theory of timed automata

Theoretical Computer Science
Semirings and formal power series: their relevance to formal languages and automata

Handbook of formal languages, vol. 1
Fuzzy ω-automata

Information Sciences—Informatics and Computer Science: An International Journal
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Kleene/Büchi-like theorem for clock languages

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Regular grammars with truth values in lattice-ordered monoid and their languages

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Skew and infinitary formal power series

Theoretical Computer Science
Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

Fuzzy Sets and Systems
Infinite fuzzy computations

Fuzzy Sets and Systems
Skew and infinitary formal power series

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A formal model of computing with words

IEEE Transactions on Fuzzy Systems

Fuzzy tree automata

Fuzzy Sets and Systems
On the recognizability of fuzzy languages II

Fuzzy Sets and Systems
Approximation of fuzzy context-free grammars

Information Sciences: an International Journal
Finite automata theory with membership values in lattices

Information Sciences: an International Journal
Weighted muller tree automata and weighted logics

Journal of Automata, Languages and Combinatorics
Weighted automata and weighted logics on infinite words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Multi-Valued MSO Logics OverWords and Trees

Fundamenta Informaticae

Quantified Score

Hi-index	0.20

Visualization

Abstract

We consider finite automata over semirings and quemirings accepting finite and infinite words, respectively. We obtain Kleene theorems for fuzzy languages consisting of finite and infinite words. Furthermore, we introduce regular fuzzy grammars and linear fuzzy systems and we show that both of them specify the class of recognizable fuzzy languages consisting of finite and infinite words.