Rabin Automaton
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
payback
11 °P sammeln
  • Broschiertes Buch

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 Büchi 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…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 Büchi 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.