Streett automaton

E2018765 UNEXPLORED

A Streett automaton is a type of ω-automaton used in formal verification and automata theory, characterized by acceptance conditions that require certain events to occur infinitely often whenever corresponding triggering events do.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Streett automaton canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Rabin automaton → relatedTo → Streett automaton ⓘ