Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning (Q5054804): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Modalities for model checking: Branching time logic strikes back / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An On-Line Edge-Deletion Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4326390 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Latest revision as of 03:08, 31 July 2024
scientific article; zbMATH DE number 7631742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning |
scientific article; zbMATH DE number 7631742 |
Statements
Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning (English)
0 references
9 December 2022
0 references
