About: Weak Büchi automaton

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science and automata theory, a Weak Büchi automaton is a formalism which represents a set of infinite words. A Weak Büchi automaton is a modification of Büchi automaton such that for all pair of states and belonging to the same strongly connected component, is accepting if and only if is accepting. 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 . For Weak Büchi automata, this condition is equivalent to the existence of a run which ultimately stays in the set of accepting states.

Property Value
dbo:abstract
  • In computer science and automata theory, a Weak Büchi automaton is a formalism which represents a set of infinite words. A Weak Büchi automaton is a modification of Büchi automaton such that for all pair of states and belonging to the same strongly connected component, is accepting if and only if is accepting. 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 . For Weak Büchi automata, this condition is equivalent to the existence of a run which ultimately stays in the set of accepting states. Weak Büchi automata are strictly less-expressive than Büchi automata and than . (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 43699276 (xsd:integer)
dbo:wikiPageLength
  • 2068 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1111523544 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In computer science and automata theory, a Weak Büchi automaton is a formalism which represents a set of infinite words. A Weak Büchi automaton is a modification of Büchi automaton such that for all pair of states and belonging to the same strongly connected component, is accepting if and only if is accepting. 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 . For Weak Büchi automata, this condition is equivalent to the existence of a run which ultimately stays in the set of accepting states. (en)
rdfs:label
  • Weak Büchi automaton (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License