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

A measure of state transition of a collective of interacting stateless automata in a discrete environment

Abstract: A collective of interacting stateless automata in a discrete geometric environment is considered as an integral automata-like computational dynamic object. A geometric approach is proposed to determine the state and measure of state transition and to analyze the dynamic properties of such objects.

A Formal Paradigm for Heterogeneous Modeling

Abstract: A hybrid automaton is a model of a system with interacting continuous and discrete dynamics. It has been successfully employed in emerging applications on the border between computer science and control theory. In this paper, hybrid automata are formally introduced. Some results on existence and uniqueness of executions for hybrid automata are obtained. Continuous dependence on initial states are shown for a class of hybrid automata. Zeno hybrid automata, i.e., hybrid automata that exhibit infinitely many discrete transitions in finite time, are also discussed.

Minimal finite automata from finite training sets

Abstract: This paper describes a solution to the following problem: Given a finite set of strings A over an alphabet Σ and a positive integer n, find a deterministic finite automaton (DFA) with a minimal number of states that recognizes the strings in the given set but does not recognize any other strings of length less than n. It turns out that, for some sets of strings A and integers n, the DFA is not uniquely determined.

A simplification of the untiming procedure for timed automata

Abstract: Given a timed automaton G accepting the language L/sup T/, a finite state machine G' can be constructed, known as the region automaton, which accepts the untimed language ut(L/sup T/). We construct an alternative finite state machine which also accepts the language ut(L/sup T/), but has fewer states than G'. This is shown for languages of both finite and infinite traces given that the time jump in the transition is strictly positive.

On the number of automorphisms of non-cyclic automata

Abstract: Various results are available on the number of automorphisms of an automaton. For the class of cyclic automata the best result is Bavel's [1]: the number of automorphisms divides the number of generators of the automaton. For the class of non-cyclic automata the only result seems to be Feichtinger's [4], who gives an upperbound to the number of automorphisms of a non-cyclic automaton. In this note it will be shown that the number of automorphisms divides Feichtinger's bound, which generalizes Bavel's result to the class of non-cyclic automata.