scientific article; zbMATH DE number 3310089

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

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, Minimization strategies for maximally parallel multiset rewriting systems, Model checking probabilistic systems against pushdown specifications, Laplace's demon consults an oracle: the computational complexity of prediction, Interrupt timed automata: verification and expressiveness, Reversible computing and cellular automata -- a survey, On spiking neural P systems and partially blind counter machines, The firing squad synchronization problem on CA with multiple updating cycles, Aeolus: a component model for the cloud, Spiking neural P systems with extended rules: universality and languages, Computational efficiency and universality of timed P systems with active membranes, Parameter synthesis for hierarchical concurrent real-time systems, Undecidability of bisimilarity for Petri nets and some related problems, Analysis and design of molecular machines, Verification of well-formed communicating recursive state machines, Universal computation and other capabilities of hybrid and continuous dynamical systems, On languages generated by spiking neural P systems with weights, Finite Gröbner basis algebra with unsolvable problem of zero divisors, Dynamical systems in categories, Generalized communicating P systems, On parametric timed automata and one-counter machines, Numerical P systems with production thresholds, The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself, Verification of qualitative $\mathbb Z$ constraints, Regular and context-free nominal traces, A 4-states algebraic solution to linear cellular automata synchronization, Confusion of memory, P systems with active membranes: Trading time for space, Model checking weighted integer reset timed automata, Graph automata: Natural expression of self-reproduction, A dynamical system which must be stable whose stability cannot be proved, Small Turing machines and generalized busy beaver competition, Quantitative separation logic and programs with lists, Functions with local state: regularity and undecidability, Multiset rewriting for the verification of depth-bounded processes with name binding, On the power of enzymatic numerical P systems, Choice and complexity, A curious new result in switching theory, Lost in abstraction: monotonicity in multi-threaded programs, Well-structured graph transformation systems, Networks of polarized multiset processors, Expressive power of first-order recurrent neural networks determined by their attractor dynamics, Priority systems with many identical processes, The constructibility of a configuration in a cellular automaton, The word and order problems for self-similar and automata groups, Automaton and group structures in certain economic adjustment mechanisms, Simple programming languages and restricted classes of Turing machines, Theoretical reconciliation of equilibrium and structural approaches, Necessary and sufficient conditions for the universality of programming formalisms, Global and local views of state fairness, Computation theoretic aspects of cellular automata, Wolfram's class IV automata and a good Life, Turing patterns with Turing machines: emergence and low-level structure formation, Generating and accepting P systems with minimal left and right insertion and deletion, Syntactic control of concurrency, Expired data collection in shared dataspaces., On the expressive power of movement and restriction in pure mobile ambients, Branching time and orthogonal bisimulation equivalence, From regulated rewriting to computing with membranes: collapsing hierarchies, The conformon-P system: a molecular and cell biology-inspired computability model, Updatable timed automata, An approach to deciding the observational equivalence of Algol-like languages, P systems with protein rules, Variants of derivation modes for which purely catalytic P systems are computationally complete, Parameterized model checking of rendezvous systems, Verification of agent navigation in partially-known environments, Finite Gröbner basis algebras with unsolvable nilpotency problem and zero divisors problem, Special issue on the foundations of software science and computation structures, When catalytic P systems with one catalyst can be computationally complete, Spiking neural P systems with a flat maximally parallel use of rules, Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete, Asynchronous homogenous spiking neural P systems with local rule synchronization, Conway's work on iteration, Global behavior of homogeneous random neural systems, Informational properties of neural nets performing algorithmic and logical tasks, Replication, refinement \& reachability: complexity in dynamic condition-response graphs, Visibly pushdown transducers, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, Bootstrapping system defined by inconsistent relation between Boolean and non-Boolean algebra, On computability by logic programs, Subrecursive neural networks, Further results on generalised communicating P systems, Probabilistic timed automata with clock-dependent probabilities, Countable sofic shifts with a periodic direction, Superposition as a decision procedure for timed automata, Quasi-periodic $\beta$-expansions and cut languages, Spiking neural P systems with polarizations and rules on synapses, DEL-based epistemic planning: decidability and complexity, Arithmetization of register machines with counters, Computational capabilities of analog and evolving neural networks over infinite input streams, A structured view on weighted counting with relations to counting, quantum computation and applications, Tiling problems and undecidability in the cluster variation method., Petri nets and regular processes, Parameterized verification of algorithms for oblivious robots on a ring, Modeling multitape Minsky and Turing machines by three-tape Minsky machines, ``Most of leads to undecidability: failure of adding frequencies to LTL, Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories, Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings, Analog neuron hierarchy, The computational power of cell-like P systems with one protein on membrane, P systems with limited number of objects, Homogeneous spiking neural P systems with structural plasticity, A return to stochasticity and probability in spiking neural P systems, How derivation modes and halting conditions may influence the computational power of P systems, An improved universal spiking neural P system with generalized use of rules, Hamiltonicity via cohomology of right-angled Artin groups, Computations on register machines with counters, Process calculi as a tool for studying coordination, contracts and session types, Timeline-based planning over dense temporal domains, The language preservation problem is undecidable for parametric event-recording automata, Small SNQ P systems with multiple types of spikes, Spiking neural P systems with target indications, On string languages generated by sequential spiking neural P systems based on the number of spikes, Counter machines and crystallographic structures, On the hierarchy of conservation laws in a cellular automaton, Stateless multicounter $5'\to 3'$ Watson-Crick automata: the deterministic case, Results on catalytic and evolution-communication P systems, Tissue P systems with channel states, On the computational strength of pure ambient calculi, Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi, On decidability and complexity of low-dimensional robot games, On separation of the emptiness and equivalence problems for program schemes, New directions in fuzzy automata, Dense-choice counter machines revisited, Unification modulo ACUI plus distributivity axioms, Sequential SNP systems based on min/max spike number, Formal specification and verification of dynamic parametrized architectures, Computations on counter machines with summator, Shannon entropy rate of hidden Markov processes, On the termination and structural termination problems for counter machines with incrementing errors, On decidability of theories of regular languages, Rule synchronization for tissue P systems, The computational power of monodirectional tissue P systems with symport rules, Neural-like P systems with plasmids, Monodirectional tissue P systems with channel states, Computations on one-dimensional cellular automata, Reactive synthesis from interval temporal logic specifications, A multiparameter analysis of the boundedness problem for vector addition systems, Boundedness, empty channel detection, and synchronization for communicating finite automata, What's decidable about weighted automata?, Morphismes unispectraux. (Unispectral morphisms), Learning (to disagree?) in large worlds, Complexity issues for timeline-based planning over dense time under future and minimal semantics, Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type, The mirage of universality in cellular automata, Solvability of the halting problem for certain classes of Turing machines, Description logics with concrete domains and general concept inclusions revisited, On the expressiveness of Linda coordination primitives., Simulation preorder over simple process algebras, The undecidability of the first-order theories of one step rewriting in linear canonical systems, CTL* model checking for data-aware dynamic systems with arithmetic, Decisiveness of stochastic systems and its application to hybrid models, Context-free timed formalisms: robust automata and linear temporal logics, Undecidable arithmetic properties of solutions of Fredholm integral equations, What is the natural abstraction level of an algorithm?, Three-way automata on rectangular types over a one-letter alphabet, A direct method for simulating partial recursive functions by Diophantine equations, Random sequence generation by cellular automata, Computability with low-dimensional dynamical systems, Algebraic power series and diagonals, Symmetry groups of automata, Microeconomic foundations of cyclical irregularities or chaos, Seven-state solutions to the firing squad synchronization problem, Small deterministic Turing machines, A six-state minimal time solution to the Firing squad synchronization problem, On machines, universal by extensions, Small universal register machines, Universality of a reversible two-counter machine, On optimal solutions to the firing squad synchronization problem, Recursion theory on the reals and continuous-time computation, A McCulloch-Pitts neural net to characterize even linear languages, Finite automata play repeated prisoner's dilemma with information processing costs, Planning for conjunctive goals, Program termination using Z-transform theory, Iterated GSMs and CO-CFL, Duration calculus: Logical foundations, A process algebraic view of Linda coordination primitives, Linear speed-up for cellular automata synchronizers and applications, Universality of the chip-firing game, Predecessor machines, Some ideas of semantic memory in automatic learning of heuristics, Automata theory, An algebraic approach to data languages and timed languages, Automata over continuous time, Tissue P systems., A universal cellular automaton in the hyperbolic plane., Undecidable problems in unreliable computations., Pushdown timed automata: A binary reachability characterization and safety verification., Undecidability of domino games and hhp-bisimilarity., Flow languages equal recursively enumerable languages, Complexity of algorithms and computations, Some simplified undecidable and NP-hard problems for simple programs, Petri nets and regular languages, On some decision problems for RAM programs, Efficient computing procedures and impossibility to solve the problem of exact prediction of events in the quantum world, The complexity of social groups and social systems described by graph structures, Canonical recursive functions and operations, Characterizations of fuzzy finite automata., Products of operators of multidimensional structured model of systems, Cellular vacuum, On the zero-inequivalence problem for loop programs, The metalogic of economic predictions, calculations and propositions, On the computational efficiency of symmetric neural networks, The modal argument for hypercomputing minds, The synchronization of nonuniform networks of finite automata, Minimisation of acyclic deterministic automata in linear time, A linear speed-up theorem for cellular automata, A note on simple programs with two variables, On the limit set of some universal cellular automata, Fuzzy neural networks, Computer simulation of reverberating spreading depression in a network of cell automata, Model checking memoryful linear-time logics over one-counter automata, Deterministic one-counter automata, On a problem in the collective behavior of automata, Deterministic Lindenmayer languages, nonterminals and homomorphisms, Finite automata and S-R models, Some decision problems related to the reachability problem for Petri nets, Toward a viable, self-reproducing universal computer, Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten, Sur une variante des fonctions séquentielles, Principles of the design of D-neuronal networks. I. A neural model for pragmatic analysis of simple melodies, Computational complexity of multitape Turing machines and random access machines, Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials, Computational expressiveness of genetic systems, Existential arithmetization of Diophantine equations, On decidability of LTL model checking for process rewrite systems, A useful lemma for context-free programmed grammars, The structure of two-dimensional scalar fields with applications to vision, Model discrimination using an algorithmic information criterion, An observation on scattered grammars, Regular production systems and triangle tilings, Asynchronous spiking neural P systems, Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, Determination of the topology of a directed network, Automata on the plane vs particles and collisions, On languages generated by asynchronous spiking neural P systems, On string languages generated by spiking neural P systems with exhaustive use of rules, On the power of elementary features in spiking neural P systems, Experiments on the reliability of stochastic spiking neural P systems, The influence of domain interpretations on computational models, What is a universal computing machine?, Comparing three semantics for Linda-like languages, Frontier between decidability and undecidability: A survey, On the computational power of BlenX, Timed automata and additive clock constraints, An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets, On computational complexity of Prolog programs, A universal cellular automaton in quasi-linear time and its S-m-n form, Functional equations associated with congruential functions, Parallel recognition of rational languages in plane cellular automata, Analysis issues in Petri nets with inhibitor arcs, Computability of affine non-conditional recurrent systems, Counter machines, Computation theory of cellular automata, Mathematical knowledge and the problem of proof, The theory of languages, Verification and comparison of transition systems, Geometry and Combinatorics via Right-Angled Artin Groups, On polynomial ideals, their complexity, and applications, Synchronization of 1-way connected processors, A simple solution of the uniform halting problem, A test for randomness based on a complexity measure, On the complexity of recurring sequences, Unnamed Item, The theory of languages, Automatic construction of test sets: Theoretical approach, A note on some systems of lindenmayer, I. General description and the problem of universal computing ability, Non-erasing turing machines: A new frontier between a decidable halting problem and universality, High undecidability of weak bisimilarity for Petri nets, Iterative devices generating infinite words, Small universal one-state linear operator algorithm, Separation logics and modalities: a survey, On-the-Fly Synthesis for Strictly Alternating Games, A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States, Logical Gates via Gliders Collisions, Small Universal Reversible Counter Machines, Unnamed Item, Decision problems for tag systems, Uniform tag sequences, Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change, Unnamed Item, Unnamed Item, Unnamed Item, Undecidability in diagonalizable algebras, Unnamed Item, Timed P Automata, Energy Complexity of Recurrent Neural Networks, On Some Classes of Sequential Spiking Neural P Systems, The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved, Spiking Neural P Systems with Thresholds, Spiking Neural P Systems with a Generalized Use of Rules, The Computation of Partial Recursive Word‐Functions Without Read Instructions, The wake up and report problem is time-equivalent to the firing squad synchronization problem, The computational power of timed P systems with active membranes using promoters, On the computational power of discrete Hopfield nets, The Undecidability of the Domino Problem, Deciding properties of integral relational automata, Behavioural equivalence for infinite systems — Partially decidable!, Shape recognition by a finite automaton robot, Reachability in Parameterized Systems: All Flavors of Threshold Automata, GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED, Programming in Biomolecular Computation, Minimal Size of Counters for (Real-Time) Multicounter Automata, Computability of String Functions Over Algebraic Structures Armin Hemmerling, Superposition for Bounded Domains, Computability by Probabilistic Turing Machines, Pebble Weighted Automata and Weighted Logics, Decidable Fragments of a Higher Order Calculus with Locations, Decidability of code properties, Reachability in Timed Counter Systems, Fast Synchronization in P Systems, First Steps Towards a Wet Implementation for τ-DPP, Unnamed Item, Unnamed Item, Unnamed Item, A state space analysis of propose-and-revise, Unnamed Item, Unnamed Item, What’s Decidable About Parametric Timed Automata?, On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems, (UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power, Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes, On the Number of Agents in P Colonies, On the Dynamics of PB Systems with Volatile Membranes, Conformon-P Systems with Negative Values, The Church-Turing Thesis over Arbitrary Domains, Asynchronous Spiking Neural P Systems: Decidability and Undecidability, Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes, On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited, An Average Case NP-complete Graph Colouring Problem, The Effect of Signaling Latencies and Node Refractory States on the Dynamics of Networks, Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application, A note on the undecidability of the reachability problem for o-minimal dynamical systems, Session Types with Arithmetic Refinements, Hilbert's Tenth Problem in Coq, UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA, Surprising Areas in the Quest for Small Universal Devices, ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION, SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS, Characterizations of the decidability of some problems for regular trace languages, On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines, Production en temps réel et complexité de structure de suites infinies, Boundedness, hierarchy of fairness, and communication networks with delay, Model-Checking Counting Temporal Logics on Flat Structures, On Petri Nets with Hierarchical Special Arcs, Comparison of max-plus automata and joint spectral radius of tropical matrices, Turing-Complete Subclasses of CHR, The Developments of the Concept of Machine Computability from 1936 to the 1960s, Necessary and Sufficient Conditions for Quantum Computation, Unnamed Item, Complete transition diagrams of generic Hamiltonian flows with a few heteroclinic orbits, Cost Problems for Parametric Time Petri Nets*, Die Automatentheorie als Teilgebiet der angewandten Mathematik, Spiking Neural P Systems with Astrocytes, Modularity in P Colonies with Checking Rules, P Systems with Active Membranes Operating under Minimal Parallelism, Asynchronous Extended Spiking Neural P Systems with Astrocytes, Computing with Multi-membranes, Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines, P Systems with Chained Rules, Non-computable rational expectations equilibria, The Complexity of Small Universal Turing Machines: A Survey, On the Termination of Integer Loops, Verification of Gap-Order Constraint Abstractions of Counter Systems, The computational power of tissue-like P systems with promoters, Numerical P systems with migrating variables, Model-checking CTL* over flat Presburger counter systems, Computation in networks of passively mobile finite-state sensors, Fast computation by population protocols with a leader, Playing with Conway's problem, THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS, Equivalence between model-checking flat counter systems and Presburger arithmetic, Mean-payoff games with partial observation, Effective storage capacity of labeled graphs, A single-copy minimal-time simulation of a torus of automata by a ring of automata, Digital mechanics. An information process based on reversible universal cellular automata, Well-structured languages, Undecidable equivalences for basic parallel processes, The Computational Power of Interactive Recurrent Neural Networks, Process-centric views of data-driven business artifacts, Uncountable realtime probabilistic classes, Asynchronous multi-agent multisorted systems, When are emptiness and containment decidable for probabilistic automata?, Bounded variability of metric temporal logic, Discrete Parameters in Petri Nets, Leveraging environmental correlations: the thermodynamics of requisite variety, Quantifier extensions of multidimensional sofic shifts, Small Universal Devices, Asynchronous Spiking Neural P Systems with Structural Plasticity, Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics, Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages, The computational power of enzymatic numerical P systems working in the sequential mode, Spiking neural P systems with rules on synapses and anti-spikes, On the classes of languages characterized by generalized P colony automata, Generalized P colonies with passive environment, Observability in the univalent universe, Floquet dynamics of classical and quantum cavity fields, A new reconstruction and the first implementation of Goto's FSSP algorithm, Model checking and synthesis for branching multi-weighted logics, Discrete Transfinite Computation, Verification of gap-order constraint abstractions of counter systems, Spiking neural P systems with rules on synapses, Matrix Code, Parameterized model checking of weighted networks, A Compositional Approach to Synchronize Two Dimensional Networks of Processors, Tag systems and Collatz-like functions, Unnamed Item, Decidability and syntactic control of interference, Minimality considerations for ordinal computers modeling constructibility, Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time $D\lfloor \log_mD\rfloor$, Computing by commuting., P transducers, The many forms of hypercomputation, Church's thesis meets the $N$-body problem, Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems, Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters, Asynchronous threshold networks with multisorted signals, Periodic generalized automata over the reals, Petri nets with name creation for transient secure association, The Riemann hypothesis in computer science, Eliminating inequalities in register machines with counters, Tissue-like P systems with evolutional symport/antiport rules, Qualitative Analysis of VASS-Induced MDPs, P colonies. Survey, Metabolic computing, Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA, Cell-like P systems with polarizations and minimal rules, Undecidability and nonperiodicity for tilings of the plane, A class of restricted P colonies with string environment, On the universality of purely catalytic P systems, Approximation and complexity of functions on the integers, Subrecursive programming languages. II. On program size, On the complexity of polynomial recurrence sequences, Towards a theory of data structures, Cell-like spiking neural P systems with evolution rules, On the inference of Turing machines from sample computations, A simple neural network generating an interactive memory, Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems, Sexually reproducing cellular automata, Sequential spiking neural P systems with local scheduled synapses without delay, COMPLEX DYNAMICS OF ELEMENTARY CELLULAR AUTOMATA EMERGING FROM CHAOTIC RULES, A class of universal linear bounded automata, Characterizing the computational power of energy-based P systems, Homogeneous spiking neural P systems working in sequential mode induced by maximum spike number, Finite degree clones are undecidable, Small universal simple spiking neural P systems with weights, Quantitative information in the tuple space coordination model, A structural approach to reversible computation, Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings, Taming past LTL and flat counter systems, Rational subsets and submonoids of wreath products., Expressiveness Issues in Brane Calculi: A Survey, The firing squad synchronization problem with sub-generals, Design strategies for rewrite rules, Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, SPIKING NEURAL P SYSTEMS: AN EARLY SURVEY, Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data, Future-Looking Logics on Data Words and Trees, (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata, On the Relationship between π-Calculus and Finite Place/Transition Petri Nets, Weak Time Petri Nets Strike Back!, Undecidability of Propositional Separation Logic and Its Neighbours, Universality in Molecular and Cellular Computing, Information transmission in il systems^∗, Unnamed Item, Nested Timed Automata with Frozen Clocks, Temporal Specifications with Accumulative Values, Interprocedural Reachability for Flat Integer Programs, 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, Two-Variable Separation Logic and Its Inner Circle, Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting, 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, Pāṇini's Grammar and Modern Computation, 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, P Systems Working in Maximal Variants of the Set Derivation Mode, Computational Power of Protein Networks, P Colonies with Evolving Environment, Unnamed Item, Boundedness problems for Minsky counter machines, Counting Infinitely by Oritatami Co-transcriptional Folding, OPTIMAL RESULTS FOR THE COMPUTATIONAL COMPLETENESS OF GEMMATING (TISSUE) P SYSTEMS, NON-RECURSIVE TRADE-OFFS FOR TWO-WAY MACHINES, Honest Computability and Complexity, Why Post Did [Not Have Turing’s Thesis], Consensual languages and matching finite-state computations, A General Framework for Regulated Rewriting Based on the Applicability of Rules, P Colonies and Their Extensions, Nanomachine Computing by Quorum Sensing, CELLULAR AUTOMATON SUPERCOLLIDERS, A Note on C² Interpreted over Finite Data-Words, Time-Free Spiking Neural P Systems, Boundedness problems for Minsky counter machines, A note on the complexity of program evaluation, 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, Communicating processes, scheduling, and the complexity of nontermination, Deciding bisimulation-like equivalences with finite-state processes, On quasi-unilateral universal Turing machines, ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON, Spiking Neural P Systems with Weights, Computing with energy and chemical reactions, Efficient Turing-Universal Computation with DNA Polymers, Verification of Timed-Arc Petri Nets, Distributed transformations of Hamiltonian shapes based on line moves, ON STRING LANGUAGES GENERATED BY SPIKING NEURAL P SYSTEMS WITH ANTI-SPIKES, SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS, Abstraction refinement and antichains for trace inclusion of infinite state systems, CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES, Computability Power of Mobility in Enhanced Mobile Membranes, The Reachability Problem over Infinite Graphs, A Survey on Picture-Walking Automata, Energy Games in Multiweighted Automata, MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS, Membrane division, restricted membrane creation and object complexity in P systems, P colonies and prescribed teams, An algebraic characterization of 𝑘–colorability, Different time solutions for the firing squad synchronization problem on basic grid networks, ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS, 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, THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS, Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic, Language Emptiness of Continuous-Time Parametric Timed Automata, Global order from local sources, Expert Control for a Robot Body, Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change, From P Colonies to 2D P Colonies and Simulations of Multiagent Systems, Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems, P Systems with Toxic Objects, Promoters and Inhibitors in Purely Catalytic P Systems, The Abilities of P Colony Based Models in Robot Control, Small Universal Spiking Neural P Systems with Cooperating Rules as Function Computing Devices, When to Move to Transfer Nets, Register machine proof of the theorem on exponential diophantine representation of enumerable sets, The topological entropy of cellular automata is uncomputable, On the computational power of totalistic cellular automata, CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence, The Most General Conservation Law for a Cellular Automaton, Updatable Timed Automata with Additive and Diagonal Constraints, EXACT APPROXIMATIONS OF OMEGA NUMBERS, An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem, On storing arbitrarily many extendible arrays of arbitrary dimensions, REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS, Perceptual-learning machines and the brain, Termination Problems in Chemical Kinetics, About 4-States Solutions to the Firing Squad Synchronization Problem, HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?, The Expressiveness of Concentration Controlled P Systems, Turing universality of the Biochemical Ground Form, Unnamed Item, Horn clause computability, A language for inquiring about the run-time behaviour of programs, AUTOMATED ALGORITHM FINDING, Expressiveness of Multiple Heads in CHR, Periodicity and Immortality in Reversible Computing, On the Computational Power of Biochemistry, Halteprobleme von Fang-Systemen (tag systems), A Natural Axiomatization of Computability and Proof of Church's Thesis, On the Expressive Power of Restriction and Priorities in CCS with Replication, Iterating Octagons, Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen, Sequentiality Induced by Spike Number in SNP Systems, On Model Checking Boolean BI, MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS, Statistical mechanics of cellular automata, Linear-time temporal logics with Presburger constraints: an overview ★, Analyzing Real-Time Event-Driven Programs, THE COMPETENCE OF A MULTIPLE CONTEXT LEARNING SYSTEM, (Tissue) P systems with cell polarity, An expressiveness study of priority in process calculi, On the expressive power of recursion, replication and iteration in process calculi, Deciding reachability problems in Turing-complete fragments of Mobile Ambients, The word problem and the isomorphism problem for groups, Conservative reduction classes of Krom formulas