The following pages link to (Q5590814):
Displaying 50 items.
- Turing patterns with Turing machines: emergence and low-level structure formation (Q256719) (← links)
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- Small (purely) catalytic P systems simulating register machines (Q264529) (← links)
- Flat maximal parallelism in P systems with promoters (Q264535) (← links)
- Computing with viruses (Q264553) (← links)
- Cell-like spiking neural P systems (Q264559) (← links)
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) (Q288804) (← links)
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- The decision problem of modal product logics with a diagonal, and faulty counter machines (Q295920) (← links)
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- Ordered multi-stack visibly pushdown automata (Q344793) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
- Universality of sequential spiking neural P systems based on minimum spike number (Q391185) (← links)
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- Irreversibility and dissipation in finite-state automata (Q397759) (← links)
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
- Unconventional algorithms: complementarity of axiomatics and construction (Q406192) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation (Q418663) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- The firing squad synchronization problem on CA with multiple updating cycles (Q475400) (← links)
- Aeolus: a component model for the cloud (Q476172) (← links)
- Computational efficiency and universality of timed P systems with active membranes (Q487991) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Analysis and design of molecular machines (Q498934) (← links)
- On languages generated by spiking neural P systems with weights (Q506742) (← links)
- Dynamical systems in categories (Q513904) (← links)
- On parametric timed automata and one-counter machines (Q515666) (← links)
- Numerical P systems with production thresholds (Q524281) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- P systems with active membranes: Trading time for space (Q537818) (← links)
- Model checking weighted integer reset timed automata (Q537908) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- Choice and complexity (Q581191) (← links)
- A curious new result in switching theory (Q582260) (← links)
- On the verification of membrane systems with dynamic structure (Q609035) (← links)
- Communication complexity and intrinsic universality in cellular automata (Q616488) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- On generalized communicating P systems with minimal interaction rules (Q616499) (← links)
- P systems with minimal insertion and deletion (Q616500) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- A weakly universal spiking neural P system (Q630746) (← links)
