The following pages link to (Q5317419):
Displaying 50 items.
- Topology on words (Q1019711) (← links)
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
- Weak bases and quasi-pseudo-metrization of bispaces (Q1032955) (← links)
- Level two of the quantifier alternation hierarchy over infinite words (Q1635804) (← links)
- The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- Sequentializing cellular automata (Q1656688) (← links)
- Recognizable sets of power series over finite fields (Q1695187) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)
- Computational capabilities of analog and evolving neural networks over infinite input streams (Q1713481) (← links)
- Tree-shifts of finite type (Q1758160) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- Finite-state independence (Q1787949) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Decimation and interleaving operations in one-sided symbolic dynamics (Q2020044) (← links)
- Preservation of normality by non-oblivious group selection (Q2035474) (← links)
- Nilpotency and periodic points in non-uniform cellular automata (Q2041685) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Automata on infinite trees (Q2074210) (← links)
- Minimisation of automata (Q2074212) (← links)
- Varieties (Q2074217) (← links)
- Wadge-Wagner hierarchies (Q2074220) (← links)
- Equational theories for automata (Q2074221) (← links)
- Gardens of Eden in the game of life (Q2086742) (← links)
- On the Weihrauch degree of the additive Ramsey theorem over the rationals (Q2104276) (← links)
- Descriptive set theory, from Cantor to Wadge and beyond (Q2148861) (← links)
- Preservation of normality by unambiguous transducers (Q2163983) (← links)
- Bisimulation invariant monadic-second order logic in the finite (Q2182315) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Classical and effective descriptive complexities of \(\omega \)-powers (Q2271988) (← links)
- Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP (Q2287411) (← links)
- Boolean algebras of regular languages (Q2342107) (← links)
- Normality and two-way automata (Q2343136) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- Completeness results for omega-regular algebras (Q2347912) (← links)
- Omega-rational expressions with bounded synchronization delay (Q2354594) (← links)
- Shift-invariant topologies for the Cantor space \(X^{\omega}\) (Q2357113) (← links)
- Fuzzy tree automata (Q2372277) (← links)
- Dynamical directions in numeration (Q2372766) (← links)
