scientific article; zbMATH DE number 3310089
From MaRDI portal
Publication:5590814
zbMath0195.02402MaRDI QIDQ5590814
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computability and recursion theory (03D99) Theory of computing (68Qxx)
Related Items (only showing first 100 items - show all)
Design strategies for rewrite rules ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Unnamed Item ⋮ Three analog neurons are Turing universal ⋮ Extended spiking neural P systems with white hole rules and their red-green variants ⋮ Some new results of P colonies with bounded parameters ⋮ A design of generalized minimum-state-change FSSP algorithms and their implementations ⋮ Spiking neural P systems with lateral inhibition ⋮ Coverability in 2-VASS with one unary counter is in NP ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ Spiking neural P systems with autapses ⋮ Counting infinitely by oritatami co-transcriptional folding ⋮ Single semi-contextual insertion-deletion systems ⋮ Infinite results ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ Tissue P Systems with Vesicles of Multisets ⋮ Normal forms for spiking neural P systems and some of its variants ⋮ Small universal improved spiking neural P systems with multiple channels and autapses ⋮ Universality of SN P systems with stochastic application of rules ⋮ On the computational power of swarm automata using agents with position information ⋮ A tutorial on the formal framework for spiking neural P systems ⋮ Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) ⋮ Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets ⋮ LTL-specification for development and verification of control programs ⋮ Variants of P systems with activation and blocking of rules ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ Asynchronous spiking neural P systems with local synchronization of rules ⋮ A solver for arrays with concatenation ⋮ Integer Weighted Automata on Infinite Words ⋮ Numerical spiking neural P systems with weights ⋮ Spiking neural P systems: main ideas and results ⋮ Waiting for the rapture: what can we do with computers to (hopefully) witness the emergence of life? ⋮ A provably stable neural network Turing machine with finite precision and time ⋮ Boundedness problems for Minsky counter machines ⋮ OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS ⋮ NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES ⋮ A Note on C² Interpreted over Finite Data-Words ⋮ Boundedness problems for Minsky counter machines ⋮ A survey of computational complexity results in systems and control ⋮ Cut Languages in Rational Bases ⋮ Hardness Results for Coverability Problem of Well-Structured Pushdown Systems ⋮ Non-deterministic structures of computation ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ On quasi-unilateral universal Turing machines ⋮ Computing with energy and chemical reactions ⋮ Distributed transformations of Hamiltonian shapes based on line moves ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems ⋮ An algebraic characterization of 𝑘–colorability ⋮ On pure space vs catalytic space ⋮ Freezing, Bounded-Change and Convergent Cellular Automata ⋮ LTL-Specification of Bounded Counter Machines ⋮ LTL-Specification of Counter Machines ⋮ Continuous One-counter Automata ⋮ Small (purely) catalytic P systems simulating register machines ⋮ Flat maximal parallelism in P systems with promoters ⋮ Computing with viruses ⋮ Cell-like spiking neural P systems ⋮ Timed recursive state machines: expressiveness and complexity ⋮ Reachability problems on reliable and lossy queue automata ⋮ Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) ⋮ Parsimonious computational completeness ⋮ Integer weighted automata on infinite words ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ The decision problem of modal product logics with a diagonal, and faulty counter machines ⋮ Improved undecidability results on weighted timed automata ⋮ Boundedness undecidability for synchronized nets ⋮ Robust parametric reachability for timed automata ⋮ Construction universality in purely asynchronous cellular automata ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Ordered multi-stack visibly pushdown automata ⋮ Dynamic self-assembly in living systems as computation ⋮ On selective unboundedness of VASS ⋮ Applicability conditions for plans with loops: computability results and algorithms ⋮ Using well-structured transition systems to decide divergence for catalytic P systems ⋮ On small universal antiport P systems ⋮ Normal forms for spiking neural P systems ⋮ Extended regular expressions: succinctness and decidability ⋮ On the verification of membrane systems with dynamic structure ⋮ P systems with minimal parallelism ⋮ Shuffled languages -- representation and recognition ⋮ Decision problems for pushdown threads ⋮ The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) ⋮ Universality of sequential spiking neural P systems based on minimum spike number ⋮ On Goles' universal machines: a computational point of view ⋮ Communication complexity and intrinsic universality in cellular automata ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ On generalized communicating P systems with minimal interaction rules ⋮ P systems with minimal insertion and deletion ⋮ Irreversibility and dissipation in finite-state automata ⋮ Undecidability of accordance for open systems with unbounded message queues ⋮ Unconventional algorithms: complementarity of axiomatics and construction ⋮ On the semantics of strategy logic ⋮ Non-recursive trade-offs between two-dimensional automata and grammars ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Low dimensional hybrid systems -- decidable, undecidable, don't know ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation ⋮ A weakly universal spiking neural P system ⋮ The expressive power of analog recurrent neural networks on infinite input streams
This page was built for publication:
