The following pages link to (Q5517677):
Displaying 18 items.
- Infinitary tree languages recognized by \(\omega\)-automata (Q794179) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
- The temporal semantics of concurrent programs (Q1143164) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
- \(\omega\)-computations on Turing machines (Q1242685) (← links)
- The inference of tree languages from finite samples: An algebraic approach (Q1329735) (← links)
- On the factors of automatic words (Q1392016) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- Learning power and language expressiveness. (Q1874277) (← links)
- Weighted automata (Q2074206) (← links)
- Automata on finite trees (Q2074209) (← links)
- Varieties (Q2074217) (← links)
- ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- Verifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol (Q4921502) (← links)
- Automated grading of regular expressions (Q6535229) (← links)
