Pages that link to "Item:Q949621"
From MaRDI portal
The following pages link to Fine hierarchies and m-reducibilities in theoretical computer science (Q949621):
Displaying 16 items.
- Fine hierarchies via Priestley duality (Q424549) (← links)
- Precomplete numberings (Q2036469) (← links)
- Non-collapse of the effective wadge hierarchy (Q2117803) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces (Q2682909) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
- Towards a descriptive theory of cb<sub>0</sub>-spaces (Q4593243) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- Non-collapse of the effective Wadge hierarchy (Q5061393) (← links)
- A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES (Q5082062) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- Two Effective Properties of ω-Rational Functions (Q6169907) (← links)
