Chi Automata

Some articles on chi automata, automata, chi:

Büchi Automaton - Transforming From Other Models of Description To Non-deterministic Büchi Automata
... From generalized Büchi automata(GBA) Multiple sets of states in acceptance condition can be translated into one set of states by an automata construction, which is known as "counting construction" ... F0...Fn are sets of accepting states then the equivalent Büchi automaton is A' = (Q', Σ, ∆',q'0,F'), where Q' = Q × {1...n} q'0 = ( q0,1 ) ∆' = { ( (q,i), a, (q',j) )