Pages that link to "Item:Q1061501"
From MaRDI portal
The following pages link to Codeterministic automata on infinite words (Q1061501):
Displaying 5 items.
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction (Q917321) (← links)
- Varieties of finite monoids and Büchi-McNaughton theorem (Q1193885) (← links)
- Confluent linear numeration systems (Q1202923) (← links)
- Unambiguous Büchi automata. (Q1401292) (← links)
- Linear numeration systems, θ-developments and finite automata (Q5096150) (← links)