The following pages link to (Q4385530):
Displayed 50 items.
- Rational digit systems over finite fields and Christol's theorem (Q331134) (← links)
- Hyperbolicity of monoids presented by confluent monadic rewriting systems. (Q375928) (← links)
- Processes with infinite liveness requirements (Q383788) (← links)
- Sofic tree-shifts (Q385506) (← links)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- Computation as an unbounded process (Q418791) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Program verification: state of the art, problems, and results. II (Q466002) (← links)
- Validating XML document adaptations via hedge automata transformations (Q477202) (← links)
- Dynamical systems in categories (Q513904) (← links)
- Visibly pushdown modular games (Q515657) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Boundary parametrization of self-affine tiles (Q548525) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Automata for epistemic temporal logic with synchronous communication (Q616040) (← links)
- Büchi context-free languages (Q627181) (← links)
- Automata and logics over finitely varying functions (Q636272) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- A topological property of rational \(\omega\)-languages (Q671988) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- Stochastic game logic (Q715046) (← 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)
- Regular sets over extended tree structures (Q764339) (← links)
- Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- On fairness and randomness (Q840697) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Weighted automata and weighted logics on infinite words (Q845080) (← links)
- A power-set construction for reducing Büchi automata to non-determinism degree two (Q845908) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← 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)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Inferring answers to queries (Q927868) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)