Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time (Q5096738): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Structural complexity of ω-automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fine hierarchy of regular \(\omega\)-languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3999156 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4175553 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4158997 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On ω-regular sets / rank | |||
Normal rank | |||
Latest revision as of 21:42, 29 July 2024
scientific article; zbMATH DE number 7572971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time |
scientific article; zbMATH DE number 7572971 |
Statements
Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time (English)
0 references
18 August 2022
0 references
