High Quality Content by WIKIPEDIA articles! In mathematics, a Rabin automaton is one of the many types of finite automata on infinite strings. It is of the form mathcal{A} = (Q,~Sigma,~q_0,~delta,~Omega) where Q,~q_0 and ? are defined as for Buchi automata. delta: Q times Sigma rightarrow Q is the transition function, and ? is a set of pairs (E_j,~F_j) with E_j, F_j subseteq Q. mathcal{A} accepts the input word ? if for the run rho in Q^omega of mathcal{A} on ? there exists an index i such that some state from Fi is visited infinitely often, while all states from Ei are visited finitely often.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.