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

On two-state isolated probabilistic automata

Abstract: In this paper we generalize and extend Yasui and Yajima's results on two-state two-symbol probabilistic automata to the two-state multisymbol case We use a slightly different notion of isolated probabilistic automata independent of the initial distribution An algorithm is derived to synthesize such automata Finally we show the existence of a regular language accepted by some completely isolated probabilistic automaton

Covering both stack and states while testing push-down systems

Abstract: In this paper we address the problem of generating abstract test cases from a system modelled by a push-down automaton. Existing classical coverage criteria are based either on states, transitions or loops in the automaton. This paper is based on a known theoretical result claiming that the accessible stack configurations in a push-down automaton form a regular language. We propose a new coverage criteria based both on states and on the configurations of the stack. Experimental results on a model of the Shunting Yard Algorithm are also presented.

Implicit Structures to Implement NFA's from Regular Expressions

Abstract: The aim of this paper is to compare three efficient representations of the position automaton of a regular expression: the Thompson Ɛ-automaton, the ZPC-structure and the F-structure, an optimization of the ZPC-structure. These representations are linear w.r.t. the size s of the expression, since their construction is in O(s) space and time, as well as the computation of the set δ(X, a) of the targets of the transitions by a of any subset X of states. The comparison is based on the evaluation of the number of edges of the underlying graphs respectively created by the construction step or visited by the computation of a set δ(X, a).

An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata

Abstract: Given a Probabilistic Finite Automata (PFA), a set of states S, and an error threshold e > 0, our algorithm approximates the infimum probability (quantifying over all infinite words) that the automata reaches S. Our result contrasts with the known result that the approximation problem is undecidable if we consider the supremum instead of the infimum. Since we study the probability of reaching a set of states, instead of the probability of ending in an accepting state, our work is more related to model checking than to formal languages.

Connectivity and separation in automata

Abstract: Publisher Summary This chapter presents several characteristics of connectedness and of separation in automata and discusses their relationships to other connectivity properties and to the basic structure of automata. An automaton is finite only if its set of states is finite. A primary of a nonempty finite automaton is a maximal singly generated subautomaton. The union and the intersection of subautomata of A are themselves subautomata of A. The chapter illustrates a method for finding the minimal separated subautomata of a finite automaton and explains its use in determining the homomorphisms, endomorphisms, isomorphisms, and automorphisms of finite automata. The separated parts of an automaton can be regarded as unrelated automata with the same input alphabet. Every nonempty automaton is made entirely of blocks. Many problems are profitably reducible to the natural building blocks. Two blocks of a nonempty automaton are either identical or disjoint. A nonempty subautomaton C of A is separated only if C is the union of blocks of A.