Semi-deterministic Büchi automaton
id:
semi-deterministic-b-chi-automaton-288-15248283
title:
Semi-deterministic Büchi automaton
text:
In automata theory, a semi-deterministic Büchi automaton is a special type of Büchi automaton. In such an automaton, the set of states can be partitioned into two subsets: one subset forms a deterministic automaton and also contains all the accepting states. For every Büchi automaton, a semi-deterministic Büchi automaton can be constructed such that both recognize the same ω-language. But, a deterministic Büchi automaton may not exist for the same ω-language.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Semi-deterministic_B%C3%BCchi_automaton
date created:
date modified:
2023-02-21T08:24:43Z
main entity:
{"identifier":"Q7449293","url":"https://www.wikidata.org/entity/Q7449293"}
image:
fields total:
13
integrity:
13