The following pages link to (Q3862379):
Displaying 50 items.
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- Small cancellation theory and automatic groups. II (Q810637) (← links)
- Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- A formal framework for verification of embedded custom memories of the Motorola MPC7450 microprocessor (Q816213) (← links)
- Modular fault diagnosis based on discrete event systems (Q816695) (← links)
- Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
- Multitasking supervisory control of discrete-event systems (Q816701) (← links)
- Regular grammars with truth values in lattice-ordered monoid and their languages (Q816869) (← links)
- The Pentus theorem for Lambek calculus with simple nonlogical axioms (Q817678) (← links)
- Simplifying regular expressions further (Q820947) (← links)
- Timed hyperproperties (Q821560) (← links)
- On the complexity of timed pattern matching (Q832025) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- Properties of the statistical complexity functional and partially deterministic HMMs (Q845416) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- A note on the expressive power of probabilistic context free grammars (Q851193) (← links)
- A descriptive characterisation of linear languages (Q851197) (← links)
- Programmed grammars and their relation to the LBA problem (Q852006) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- Hierarchical fault diagnosis for discrete-event systems under global consistency (Q853679) (← links)
- The power of programmed grammars with graphs from various classes (Q854407) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- The equivalence between fuzzy Mealy and fuzzy Moore machines (Q862553) (← links)
- The relationships of three elementary cellular automata (Q862997) (← links)
- On the dynamics of cellular automata induced from a prefix code (Q865286) (← links)
- The transformational creativity hypothesis (Q867497) (← links)
- Fuzzy \(h\)-ideals of hemirings. (Q867654) (← links)
- Quorum sensing P systems (Q870251) (← links)
- From searching text to querying XML streams (Q876703) (← links)
- The subadditive ergodic theorem and generic stretching factors for free group automorphisms. (Q877464) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- Defect particle kinematics in one-dimensional cellular automata (Q884475) (← links)
- The ins and outs of first-order runtime verification (Q888417) (← links)
- Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
- Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer (Q892410) (← links)
- How many ants does it take to find the food? (Q896147) (← links)
- Theory of interaction (Q896903) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Input-dependent-only object histories (Q909491) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
