Commutative grammars: the complexity of uniform word problems
Information and Control
Semirings, automata, languages
Semirings, automata, languages
A parallel machine for multiset transformation and its programming style
Future Generation Computer Systems
The equational theory of pomsets
Theoretical Computer Science
Fuzzy Sets and Systems
The gamma model and its discipline of programming
Science of Computer Programming
The theory of semirings with applications in mathematics and theoretical computer science
The theory of semirings with applications in mathematics and theoretical computer science
Selected papers of the Second Workshop on Concurrency and compositionality
Grammars with controlled derivations
Handbook of formal languages, vol. 2
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Gamma and the chemical reaction model: ten years after
Coordination programming
Journal of Computer and System Sciences
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Closure properties of multiset language families
Fundamenta Informaticae - Membrane computing
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Considerations on a Multiset Model for Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Theoretical Computer Science
Some considerations on higher-order Petri nets
Fundamenta Informaticae - Concurrency specification and programming
Evolution and observation: a non-standard way to generate formal languages
Theoretical Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Multiset random context grammars, checkers, and transducers
Theoretical Computer Science
On Semilinear Sets over Commutative Semirings
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A general framework for regulated rewriting based on the applicability of rules
Computation, cooperation, and life
Editing distances between membrane structures
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Theoretical Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On Semilinear Sets over Commutative Semirings
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Some Considerations on Higher-Order Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Closure Properties of Multiset Language Families
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
(Tissue) p systems with decaying objects
CMC'12 Proceedings of the 13th international conference on Membrane Computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Sequential p systems with regular control
CMC'12 Proceedings of the 13th international conference on Membrane Computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Analyzing Compatibility of Services via Resource Conformance
Fundamenta Informaticae - Concurrency, Specification and Programming
Properties of Languages with Catenation and Shuffle
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
| Hi-index | 0.02 |
A macroset is a (finite or infinite) set of multisets over a finite alphabet. We introduce a Chomsky-like hierarchy of multiset rewriting devices which, therefore, generate macrosets. Some results are proved about the power of these devices and some open problems are formulated. We also present an algebraic characterization of some of the macroset families as least fixed point solutions of algebraic systems of equations.