On Behaviour of R-Fuzzy Automata

The present paper deals with cut-point languages accepted by so-called R-fuzzy automata. In this notion R denotes an arbitrary partially ordered semiring which determines the special kind of f~zzy dynamics. Since the concept of R-f~zzy automaton is a generalization of the previously proposed notions of deterministic as well as stochastic automaton it seems advisable to classify the partially ordered semirings R in such a way that the appropiate R-fuzzy automata can be compared with that of deterministic or stochastic automata.