The following pages link to (Q5317419):
Displaying 50 items.
- Regular languages of thin trees (Q290908) (← links)
- AF inverse monoids and the structure of countable MV-algebras (Q308140) (← links)
- Infinite games specified by 2-tape automata (Q324245) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Sofic tree-shifts (Q385506) (← links)
- Topological extension of parity automata (Q388217) (← links)
- Local rule distributions, language complexity and non-uniform cellular automata (Q393151) (← links)
- Fuzzy local \(\omega\)-systems (Q396705) (← links)
- Path sets in one-sided symbolic dynamics (Q402586) (← links)
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610) (← links)
- Which security policies are enforceable by runtime monitors? A survey (Q465692) (← links)
- Fixed points of endomorphisms of trace monoids. (Q467531) (← links)
- Three research directions in non-uniform cellular automata (Q475396) (← links)
- On \(t\)-extensions of the Hankel determinants of certain automatic sequences (Q476840) (← links)
- Normality and automata (Q494059) (← links)
- Quantitative model-checking of controlled discrete-time Markov processes (Q515573) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Boundary parametrization of self-affine tiles (Q548525) (← links)
- Recognisability for algebras of infinite trees (Q551167) (← links)
- Fixed points of endomorphisms over special confluent rewriting systems. (Q604812) (← links)
- Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation (Q614291) (← links)
- Büchi context-free languages (Q627181) (← links)
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- A new pumping lemma for indexed languages, with an application to infinite words (Q729820) (← links)
- Counting branches in trees using games (Q729823) (← links)
- Expressive power of first-order recurrent neural networks determined by their attractor dynamics (Q736603) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- On normality in shifts of finite type (Q778523) (← links)
- Games with winning conditions of high Borel complexity (Q817850) (← links)
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words (Q832937) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← links)
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Automata on linear orderings (Q859978) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- Skew and infinitary formal power series (Q860889) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- The Hausdorff fuzzy quasi-metric (Q968925) (← links)
- Strategical languages of infinite words (Q989477) (← links)
- The stable set of a self-map (Q990771) (← links)
- Powers of rationals modulo 1 and rational base number systems (Q1001417) (← links)
- Infinite periodic points of endomorphisms over special confluent rewriting systems (Q1013030) (← links)
