The following pages link to (Q5317419):
Displaying 50 items.
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Complementation of rational sets on scattered linear orderings of finite rank (Q2381522) (← links)
- Timed substitutions for regular signal-event languages (Q2385194) (← links)
- Decidability and universality of quasiminimal subshifts (Q2402365) (← links)
- Classifying recognizable infinitary trace languages using word automata (Q2407086) (← links)
- Bounded variability of metric temporal logic (Q2408743) (← links)
- Message exchange games in strategic contexts (Q2409387) (← links)
- Finite-state independence and normal sequences (Q2424666) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- On weighted first-order logics with discounting (Q2453983) (← links)
- A complete characterization of deterministic regular liveness properties (Q2465051) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- Spectrum, algebraicity and normalization in alternate bases (Q2700692) (← links)
- Rational Selecting Relations and Selectors (Q2799220) (← links)
- MSO-definable Properties of Muller Context-Free Languages Are Decidable (Q2829973) (← links)
- Operations on Weakly Recognizing Morphisms (Q2829976) (← links)
- Computational classification of cellular automata (Q2869784) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Classifying Recognizable Infinitary Trace Languages Using Word Automata (Q2922012) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics (Q2945562) (← links)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages (Q2945564) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- Subword Metrics for Infinite Words (Q2947418) (← links)
- Language Games (Q2963989) (← links)
- On some sets of dictionaries whose ω -powers have a given (Q3053226) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- (Q3123633) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- (Q3384896) (← links)
- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (Q3449478) (← links)
- Recognisable Languages over Monads (Q3451085) (← links)
- Weighted Automata and Weighted Logics with Discounting (Q3503896) (← links)
- The Algebraic Counterpart of the Wagner Hierarchy (Q3507423) (← links)
- On the continuity set of an Omega rational function (Q3514642) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- Some Algebraic Properties of Machine Poset of Infinite Words (Q3526411) (← links)
- A new algebraic invariant for weak equivalence of sofic subshifts (Q3526413) (← links)
- Complexity of Topological Properties of Regular ω-Languages (Q3533038) (← links)
- BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS (Q3552317) (← links)
- CAYLEY AUTOMATON SEMIGROUPS (Q3621431) (← links)
- Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
- Decidable Extensions of Church’s Problem (Q3644764) (← links)
- The Wadge-Wagner hierarchy of ω-rational sets (Q4571937) (← links)
- (Q4585066) (← links)
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay (Q4588867) (← links)
- General Framework (Q4613545) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
