Article ID Journal Published Year Pages File Type
438696 Theoretical Computer Science 2007 16 Pages PDF
Abstract

We introduce a general model of random context multiset grammars as well as the concept of multiset random context checkers and transducers. Our main results show how recursively enumerable sets of finite multisets can be generated using these models of computing; corresponding results for antiport P systems are established, too.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics