Multiset processing. Mathematical, computer science, and molecular computing points of view
From MaRDI portal
Publication:5960822
DOI10.1007/3-540-45523-XzbMath0983.00053MaRDI QIDQ5960822
No author found.
Publication date: 17 April 2002
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Fast processing of graph queries on a large database of small and medium-sized data graphs ⋮ A Petri net model for membrane systems with dynamic structure ⋮ Multiset random context grammars, checkers, and transducers ⋮ Decomposition and factorization of chemical reaction transducers ⋮ Variants of P systems with activation and blocking of rules ⋮ Reaction automata ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Fuzzy multiset finite automata and their languages ⋮ A LOGICAL CHARACTERIZATION OF ROBUSTNESS, MUTANTS AND SPECIES IN COLONIES OF AGENTS ⋮ Theory of reaction automata: a survey ⋮ Composition colored Petri nets for the refinement of reaction-based models ⋮ Relations between Control Mechanisms for Sequential Grammars1 ⋮ Processes of membrane systems with promoters and inhibitors ⋮ Counter machines, Petri nets, and consensual computation ⋮ On the properties of language classes defined by bounded reaction automata ⋮ Translating Multiset Tree Automata into P Systems ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ Characterizing Membrane Structures Through Multiset Tree Automata ⋮ Multisets, heaps, bags, families: What is a multiset? ⋮ The computational capability of chemical reaction automata
