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. © 2006 Elsevier Ltd. All rights reserved.
Multiset random context grammars, checkers, and transducers / Cavaliere, M.; Freund, R.; Oswald, M.; Sburlan, D.. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 372:2-3(2007), pp. 136-151. [10.1016/j.tcs.2006.11.022]
Multiset random context grammars, checkers, and transducers
Cavaliere M.;
2007
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. © 2006 Elsevier Ltd. All rights reserved.
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0304397506008802-main.pdf
Accesso riservato
Tipologia:
VOR - Versione pubblicata dall'editore
Dimensione
339.06 kB
Formato
Adobe PDF
|
339.06 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
