Topic
ω-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.
Papers published on a yearly basis
Papers
More filters
TL;DR: Two types of finite acceptance of infinite words by finite automata are considered: an infinite word ξ is accepted if and only if there is a run on input ξ for which an accepting state is visited at least once but only finitely often.
7 citations
01 Jan 2010
TL;DR: Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring), an extension of (max,+) automata since they enable us to model temporal constraints for transitions.
Abstract: Interval weighted automata are introduced as automata with weights in a product dioid (idempotent semiring). They constitute an extension of (max,+) automata since they enable us to model temporal constraints (instead of exact durations) for transitions. Their synchronous composition, which coincides with the synchronous product of underlying (one clock) timed automata, results in multi-event interval weighted automata, whose behaviors are studied. Our approach is illustrated by an example.
7 citations
16 Jul 2003
TL;DR: It is shown that any bideterministic automaton is the unique minimal automaton among all (including nondeterministic) automata accepting the same language.
Abstract: Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. It has been known that a bideterministic automaton is the minimal deterministic automaton accepting its language. This paper shows that any bideterministic automaton is the unique minimal automaton among all (including nondeterministic) automata accepting the same language. We also present a more general result that shows that under certain conditions a minimal deterministic automaton accepting some language or the reversal of the minimal deterministic automaton of the reversal language is a minimal automaton representation of the language. These conditions can be checked in polynomial time.
7 citations
06 Sep 2015
TL;DR: An improved formulation of the problem of NFA induction into the integer nonlinear programming (INLP) problem is proposed along with the two parallel algorithms to solve it and the methods for the distribution of tasks among processors along with distributed termination detection are presented.
Abstract: The induction of a minimal nondeterministic finite automaton (NFA) consistent with a given set of examples and counterexamples, which is known to be computationally hard, is discussed. The paper is an extension to the novel approach of transforming the problem of NFA induction into the integer nonlinear programming (INLP) problem. An improved formulation of the problem is proposed along with the two parallel algorithms to solve it. The methods for the distribution of tasks among processors along with distributed termination detection are presented. The experimental results for selected benchmarks are also reported.
7 citations