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)
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
This page was built for publication:
