Complementation of Büchi automaton
id:
complementation-of-b-chi-automaton-249-11765860
title:
Complementation of Büchi automaton
text:
In automata theory, complementation of a Büchi automaton is the task of complementing a Büchi automaton, i.e., constructing another automaton that recognizes the complement of the ω-regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves that the set of ω-regular languages is closed under complementation. This construction is particularly hard relative to the constructions for the other closure properties of Büchi automata. The first constru
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Complementation_of_B%C3%BCchi_automaton
date created:
date modified:
2024-01-16T12:07:49Z
main entity:
{"identifier":"Q5156431","url":"https://www.wikidata.org/entity/Q5156431"}
image:
fields total:
13
integrity:
13