A co-buchi automaton is defined similarly to a buchi one: A = .
The acceptance condition of a co-Buchi automaton is: for an infinite word w, w is in L(A) (A's language) iff there is a run of A on w that stays in F. "Stays", in formal terms means that for an infinite run r=r1 r2 ... there is a number n such that for every m>n rm is in F.
Chat with our AI personalities