Automat of Büchi

A automat of Büchi is a Finite-state machine with a condition of particular acceptance: a trace is accepted if and only if it passes an infinite number of times by the states acceptors.

The deterministic and nondeterministic automats of Büchi are not equivalent. On the other hand, any automat of Büchi is equivalent to a Automate of deterministic Rabin.

The nondeterministic automats of Büchi represent exactly the properties of logic LTL, known as also ω-regular properties.

References

  • Wolfgang Thomas, Automata one infinity objects , in Handbook off Theoretical Computer Science: Formal Models and Semantics , volume B (Jan Van Leeuwen, ED.), MIT Close, ISBN 0262720159

Random links:824 | List consuls of the Roman Republic | Kheops (DJ) | Frank Thring | Zinalrothorn | Jean de Liçarrague | Seigneur_le_lieutenant_de_Cambridgeshire