O'Reilly logo

Handbook of Automated Reasoning by Andrei Voronkov, Alan J.A. Robinson

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

A Büchi-automaton is a finite ω-automaton, that is, a fair transition system where the set S of states is finite. A transition system (or labelled transition system) is a fair transition system where S acc = S rec = S. A weakly fair transition system is an ω-automaton where S rec = S and S acc = {s | ∀a, s′(s, a, s′) ∉ Δ}. That is, in a weakly fair transition system all states are recurring, and states are accepting iff they axe terminal. Usually, when talking about labelled and weakly fair transition systems, we omit the redundant components S acc and S rec .

A (finite or infinite) nonempty word σ ( σ 0 , σ 1 , ) is accepted by an automaton ( S , Δ , S 0 , S a c c , S r e c ) , if there ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required