ω-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.

The Bridge Between Regular Cost Functions and Omega-Regular Languages

Abstract: In this paper, we exhibit a one-to-one correspondence between omega-regular languages and a subclass of regular cost functions over finite words, called omega-regular like cost functions. This bridge between the two models allows one to readily import classical results such as the last appearance record or the McNaughton-Safra constructions to the realm of regular cost functions. In combination with game theoretic techniques, this also yields a simple description of an optimal procedure of history-determinisation for cost automata, a central result in the theory of regular cost functions.

The power of two-way deterministic checking stack automata

Abstract: It is well known that nondeterministic two-way checking stack automata recognize NSPACE( n ). We show that deterministic two-way checking stack automata have the same power as deterministic two-way two-head finite automata. The easy proof is based on the closure under inverse deterministic two-way GSM mappings of the deterministic two-way two-head finite automaton languages.

A Description of Experimental Tax Evasion Behavior Using Finite Automata: the case of Chile and Italy

Abstract: In this paper, we use a Moore Automata with Binary Stochastic Output Function in order to explore the extensive decision regarding tax evasion made by subjects in experiments run in Chile and Italy. Firstly, we show how an hypothesis about subject behavior is converted into an automaton, and how we compute the probabilities of evading for every state of an automaton. We use this procedure in order to look for the automaton which is able to anticipate the highest number of decisions made by the subjects during the experiments. Finally, we show that automata with few states perform better than automata with many states, and that the bomb-crater efiect described in Mittone (2006) [1] is a well identifled pattern of behavior in a subset of subjects.

The Structures of Automata to Adapt to an Unknown Environment

Abstract: A general fixed structure automaton acting in stationary random multireaction environment is described. Some necessary conditions are shown for automata to be purposeful or adaptive in an unknown environment (to be more profitable than a no-purpose, or random, automaton). By the necessary conditions it is proved that there exists no perfectly adaptive automaton. A necessary condition for automata with minimum state space to be purposeful is obtained. This condition characterizes their structures explicitly, so that a little restriction gives a sufficient condition. Some general subclasses of automata are proposed, and necessary and sufficient conditions for such automata to be purposeful are investigated. Furthermore as properties of a purposeful automaton, the time required to adapt and the stability of adapting to the random environment are discussed.