Closure Properties of Multiset Language Families

Authors:
Manfred Kudlek;Victor Mitrana
Affiliations:
Fachbereich Informatik, Universität Hamburg, Vogt-Kölln-Straße 30, D-22527 Hamburg, Germany;University of Bucharest, Faculty of Mathematics, Str. Academiei 14, 70109, Bucharest, Romania
Venue:
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Year:
2002

Citing 4
Cited 5

Formal languages

Formal languages
Computing with membranes

Journal of Computer and System Sciences
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Probability in Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Multiset Pushdown Automata

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)
Probability in Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Analyzing Compatibility of Services via Resource Conformance

Fundamenta Informaticae - Concurrency, Specification and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiset languages are languages defined by multiset grammars in the sense of [4]. We extend to multiset languages the usual operations defined for string languages and define new operations specific for multiset languages. The closure properties of the main classes of multiset languages are investigated. Along these lines we introduce two notions of abstract family of multiset languages.