Infinite fuzzy computations

Authors:
George Rahonis
Affiliations:
Department of Mathematics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
Venue:
Fuzzy Sets and Systems
Year:
2005

Citing 12
Cited 10

Semirings, automata, languages

Semirings, automata, languages
Rational series and their languages

Rational series and their languages
Behaviour, reduction and minimization of finite :G6-automata

Fuzzy Sets and Systems
A formal power series approach to the construction of minimal fuzzy automata

Information Sciences: an International Journal
Fuzzy acceptors for syntactic pattern recognition

International Journal of Approximate Reasoning
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Equivalence, reduction and minimization of finite automata over semirings

Theoretical Computer Science
Finite Automata Computing Real Functions

SIAM Journal on Computing
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
R-Fuzzy Automata with a Time-Variant Structure

Proceedings of the 3rd Symposium on Mathematical Foundations of Computer Science

Skew and infinitary formal power series

Theoretical Computer Science
Fuzzy tree automata

Fuzzy Sets and Systems
Computing behavior of finite fuzzy machines - Algorithm and its application to reduction and minimization

Information Sciences: an International Journal
Fuzzy regular languages over finite and infinite words

Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Reduction and minimization

Fuzzy Sets and Systems
Regular expressions on average and in the long run

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
Valuations of weighted automata: doing it in a rational way

Algebraic Foundations in Computer Science
Multi-Valued MSO Logics OverWords and Trees

Fundamenta Informaticae

Quantified Score

Hi-index	0.21

Visualization

Abstract

We consider Buchi automata weighted over the fuzzy semiring F=([0,1],max,min,0,1). A Buchi theorem for the class of @w-recognizable series with coefficients in F, i.e., for behaviors of Buchi automata over F is established. Furthermore, we show that an infinitary language is Buchi recognizable iff its characteristic series is @w-recognizable.