ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.

Lattice-valued Finite Automata and Its Properties

Abstract: The concept of lattice-valued finite automata is formulated,its properties and homomorphism are detailedly studied,and close link between it and the algebraic properties of lattice-ordered monoid which these automata take values are disclosed,and many important results are obtained

Minimization of Mizumoto Automata

Abstract: In this paper, we introduce Mizumota automata whose initial and final states are fuzzy. Furthermore, the equivalence of the type of Mizumoto automaton(MA) and canonical fuzzy finite automaton(CA) with single initial state and deterministic transition function is established. Then we present a method to minimize the states of automata in canonical form.

On Multiple Finite Automata

Abstract: The k-multiple automata introduced in this paper are devices for the recognition (or generation) of languages rather than transducers devices providing sequential mappings of the input sequences into the output ones. The new and most important and powerful step in the recognition procedure provided by a k-multiple automaton is that the considered string is divided into k parts of the same length. Further these parts are recognized “simultaneously” by k simple, i.e. ordinary automata, which are controlled by a single and common transition function. This is an explanation why the multiple automata can be much more powerful than the simple ones.