Multiset processing. Mathematical, computer science, and molecular computing points of view
From MaRDI portal
Cited in
(23)- Composition colored Petri nets for the refinement of reaction-based models
- Fuzzy multiset finite automata and their languages
- Theory of reaction automata: a survey
- The computational capability of chemical reaction automata
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Decomposition and factorization of chemical reaction transducers
- A Petri net model for membrane systems with dynamic structure
- Fast processing of graph queries on a large database of small and medium-sized data graphs
- A LOGICAL CHARACTERIZATION OF ROBUSTNESS, MUTANTS AND SPECIES IN COLONIES OF AGENTS
- Reaction automata
- The computing power of determinism and reversibility in chemical reaction automata
- Relations between Control Mechanisms for Sequential Grammars1
- Counter machines, Petri nets, and consensual computation
- Translating Multiset Tree Automata into P Systems
- Multisets, heaps, bags, families: what is a multiset?
- Characterizing Membrane Structures Through Multiset Tree Automata
- Variants of P systems with activation and blocking of rules
- Perfect stationary solutions of reaction-diffusion equations on lattices and regular graphs
- Multiset reaction systems
- On the properties of language classes defined by bounded reaction automata
- Multiset random context grammars, checkers, and transducers
- Processes of membrane systems with promoters and inhibitors
- Determinization of weighted finite automata over strong bimonoids
This page was built for publication: Multiset processing. Mathematical, computer science, and molecular computing points of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960822)
