Andere Kunden interessierten sich auch für
![Speed of Light (cellular automaton)]( "Speed of Light (cellular automaton)")
Speed of Light (cellular automaton)22,99 €![Rabin Fingerprint]( "Rabin Fingerprint")
Rabin Fingerprint22,99 €![Rabin style speed-up of proofs]( "Rabin style speed-up of proofs")
Rabin style speed-up of proofs32,99 €![Equations in Self-Similar Groups]( "Equations in Self-Similar Groups")
Equations in Self-Similar Groups44,99 €![A Study of Directed Graph and Related Computer Programming]( "A Study of Directed Graph and Related Computer Programming")
A Study of Directed Graph and Related Computer Programming46,99 €![MATHEMATICAL MODELING OF SOME ASPECTS OF DIGRAPHS]( "MATHEMATICAL MODELING OF SOME ASPECTS OF DIGRAPHS")
MATHEMATICAL MODELING OF SOME ASPECTS OF DIGRAPHS46,99 €![The Cellular Automaton Interpretation of Quantum Mechanics]( "The Cellular Automaton Interpretation of Quantum Mechanics")
The Cellular Automaton Interpretation of Quantum Mechanics37,99 €
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.