The following pages link to (Q3862379):
Displaying 50 items.
- Bounded underapproximations (Q453533) (← links)
- Binary trees as a computational framework (Q461478) (← links)
- Asynchronous \(l\)-complete approximations (Q464604) (← links)
- Subalgebras of FA-presentable algebras. (Q466920) (← links)
- Simple linear string constraints (Q469349) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Head and state hierarchies for unary multi-head finite automata (Q478518) (← links)
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
- Budget-bounded model-checking pushdown systems (Q479843) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Minimal sensor activation and minimal communication in discrete-event systems (Q503031) (← links)
- On information invariants in robotics (Q504012) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- A distributed protocol for motion coordination in free-range vehicular systems (Q522801) (← links)
- Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Bulking II: Classifications of cellular automata (Q549701) (← links)
- On iterated hairpin completion (Q551189) (← links)
- Characterizations of hemirings by \((\in,\in\vee\! q_k)\)-fuzzy ideals. (Q552266) (← links)
- XML queries and constraints, containment and reformulation (Q555769) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- The generative capacity of block-synchronized context-free grammars (Q557813) (← links)
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group (Q557909) (← links)
- Two-dimensional cellular automata (Q579933) (← links)
- Decision problems of object histories (Q582039) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- The most nonelementary theory (Q598194) (← links)
- Bottom-up design of strategic options as finite automata (Q601965) (← links)
- Complexity of evolution languages of the elementary cellular automaton of rule 146 (Q621874) (← links)
- Grammatical verification for mathematical formula recognition based on context-free tree grammar (Q626924) (← links)
- Topology, formal languages and quantum information (Q627065) (← links)
- On Lebesgue measure of integral self-affine sets (Q635751) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- Analogues of quantum complementarity in the theory of automata (Q639815) (← links)
- Querying data sources that export infinite sets of views (Q639847) (← links)
- Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
- Embedding dualities for set partitions and for relational structures (Q648966) (← links)
- Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal (Q656586) (← links)
- On the vector space of the automatic reals (Q671363) (← links)
- On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems (Q671421) (← links)
- Interval logics and their decision procedures. II: A real-time interval logic (Q672040) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- On the topological size of p-m-complete degrees (Q672460) (← links)
