The following pages link to (Q5317419):
Displaying 50 items.
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← links)
- Some results on<i>C</i>-varieties (Q4680738) (← links)
- Algebraic and graph-theoretic properties of infinite<i>n</i>-posets (Q4680742) (← links)
- Complementation of Branching Automata for Scattered and Countable N-Free Posets (Q4683231) (← links)
- Polynomial-time right-ideal morphisms and congruences (Q4686444) (← links)
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (Q4692085) (← links)
- ACTIONS, LENGTH FUNCTIONS, AND NON-ARCHIMEDEAN WORDS (Q4916963) (← links)
- (Q4964807) (← links)
- (Q4989401) (← links)
- Bisimulation Invariant Monadic-Second Order Logic in the Finite (Q5002802) (← links)
- Back to the Coordinated Attack Problem (Q5006457) (← links)
- A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves (Q5009440) (← links)
- (Q5016362) (← links)
- The Polycyclic Inverse Monoids and the Thompson Groups Revisited (Q5018536) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- (Q5028446) (← links)
- Weighted Automata and Weighted Logics (Q5072547) (← links)
- (Q5089255) (← links)
- (Q5089284) (← links)
- Model-Free Reinforcement Learning for Stochastic Parity Games (Q5089286) (← links)
- (Q5092424) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- (Q5101351) (← links)
- A Characterisation of Pi^0_2 Regular Tree Languages (Q5111272) (← links)
- (Q5111328) (← links)
- (Q5129949) (← links)
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- (Q5155680) (← links)
- Security Policies Enforcement Using Finite Edit Automata (Q5166611) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- (Q5207048) (← links)
- (Q5207050) (← links)
- (Q5216308) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- Some completely semisimple HNN-extensions of inverse semigroups (Q5221276) (← links)
- Boundary dynamics for bireversible and for contracting automaton groups (Q5221286) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← links)
- (Q5232903) (← links)
- Regular tree languages in low levels of the Wadge hierarchy (Q5232909) (← links)
- (Q5376657) (← links)
- Polishness of some topologies related to word or tree automata (Q5376660) (← links)
- (Q5377469) (← links)
- (Q5384174) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- Automata, Borel functions and real numbers in Pisot base (Q5444100) (← links)
- From Asynchronous to Synchronous Specifications for Distributed Program Synthesis (Q5448644) (← links)
- On Decision Problems for Probabilistic Büchi Automata (Q5458366) (← links)
- On the structure of the space of complexity partial functions (Q5459746) (← links)
- THE MISSING LINK FOR ω-RATIONAL SETS, AUTOMATA, AND SEMIGROUPS (Q5470163) (← links)
- An upper bound on the complexity of recognizable tree languages (Q5501862) (← links)
