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

Logical characterization of weighted pebble walking automata

Abstract: Weighted automata are a conservative quantitative extension of finite automata that enjoys applications, e.g., in language processing and speech recognition. Their expressive power, however, appears to be limited, especially when they are applied to more general structures than words, such as graphs. To address this drawback, weighted automata have recently been generalized to weighted pebble walking automata, which proved useful as a tool for the specification and evaluation of quantitative properties over words and nested words. In this paper, we establish the expressive power of weighted pebble walking automata in terms of transitive closure logic, lifting a similar result by Engelfriet and Hoogeboom from the Boolean case to a quantitative setting. This result applies to general classes of graphs, including all the aforementioned classes.

A Decidable Extension of Data Automata

Abstract: Data automata on data words is a decidable model proposed by Bojanczyk et al. in 2006. Class automata, introduced recently by Bojanczyk and Lasota, is an extension of data automata which unifies different automata models on data words. The nonemptiness of class automata is undecidable, since class automata can simulate two-counter machines. In this paper, a decidable model called class automata with priority class condition, which restricts class automata but strictly extends data automata, is proposed. The decidability of this model is obtained by establishing a correspondence with priority multicounter automata. This correspondence also completes the picture of the links between various class conditions of class automata and various models of counter machines. Moreover, this model is applied to extend a decidability result of Alur, Cerný and Weinstein on the algorithmic analysis of array-accessing programs.

On computational power of weighted finite automata

Abstract: Weighted Finite Automata are automata with multiplicities used to compute real functions by reading infinite words. The aim of this paper is to study what kind of functions can be computed by level automata, a particular subclass of WFA. Several results concerning the continuity and the smoothness of these functions are shown. In particular, the only smooth functions that can be obtained are the polynomials. This enables to decide whether a function computed by a level automaton is smooth or not.

Converting Self-verifying Automata into Deterministic Automata

Abstract: Self-verifying automata are a special variant of finite automata with a symmetric kind of nondeterminism. In this paper, we study the transformation of self-verifying automata into deterministic automata from a descriptional complexity point of view. The main result is the exact cost, in terms of the number of states, of such a simulation.

A Formal Theory of Simulations Between Infinite Automata

Abstract: Automata are suitable for modeling a wide range of sequential and concurrent hardware. They can be used at many levels of abstraction, from top-level specifications to register transfer descriptions suitable for input to synthesis tools. This paper covers approaches for relating one automaton with another using simulations and transformations on automata. The entire theory is mechanically derived in, and intended for use in a higher-order logic theorem prover. Because automaton-based models can be used at multiple abstraction levels, much of the formal verification of sequential and concurrent designs can be performed by composing and relating automata.