词条 | Co-Büchi automaton |
释义 |
In automata theory, a co-Büchi automaton is a variant of Büchi automaton. The only difference is the accepting condition: a Co-Büchi automaton accepts an infinite word if there exists a run, such that all the states occurring infinitely often in the run are in the final state set . In contrast, a Büchi automaton accepts a word if there exists a run, such that at least one state occurring infinitely often in the final state set . (Deterministic) Co-Büchi automata are strictly weaker than (nondeterministic) Büchi automata. Formal definitionFormally, a deterministic co-Büchi automaton is a tuple that consists of the following components:
In a non-deterministic co-Büchi automaton, the transition function is replaced with a transition relation . The initial state is replaced with an initial state set . Generally, the term co-Büchi automaton refers to the non-deterministic co-Büchi automaton. For more comprehensive formalism see also ω-automaton. Acceptance ConditionThe acceptance condition of a co-Büchi automaton is formally The Büchi acceptance condition is the complement of the co-Büchi acceptance condition: PropertiesCo-Büchi automata are closed under union, intersection, projection and determinization. {{DEFAULTSORT:Co-Buchi automaton}} 1 : Finite automata |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。