Multiset random context grammars, checkers, and transducers

被引：18

作者：

Cavaliere, Matteo

Freund, Rudolf ^{[1
]}

Oswald, Marion

Sburlan, Dragos

机构：

[1] Vienna Univ Technol, Fac Informat, Vienna, Austria

[2] Microsoft Res Univ Trento, Ctr Computat & Syst Biol, Trenton, NJ USA

[3] Univ Seville, Dept Comp Sci & Artificial Intelligence, Seville 41012, Spain

[4] Ovidius Univ Constantza, Dept Informat & Numer Methods, Constanta, Romania

来源：

THEORETICAL COMPUTER SCIENCE | 2007年 / 372卷 / 2-3期

关键词：

antiport; checker; multiset grammar; P system; random context; transducer;

D O I：

10.1016/j.tcs.2006.11.022

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. (c) 2006 Elsevier B.V. All rights reserved.

引用

页码：136 / 151

页数：16

共 19 条

[1] [Anonymous], 2001, LECT NOTES COMPUTER
[2] CALUDE CS, 2001, LECT NOTES COMPUTER, V2235
[3] CAVALLIERE M, 2006, THESIS U SEVILLA SPA
[4] From Watson-Crick L systems to Darwinian P systems
Erzsébet Csuhaj-Varjú
Carlos Martín-Vide
Gheorgh Păaun
Arto Salomaa
[J]. Natural Computing, 2003, 2 (3) : 299 - 318
[5] Dassow J., 2012, Regulated Rewriting in Formal Language Theory
[6] Tissue P systems with channel states
Freund, R
Paun, G
Pérez-Jiménez, MJ
[J]. THEORETICAL COMPUTER SCIENCE, 2005, 330 (01) : 101 - 116
[7] Freund R, 2002, FUND INFORM, V49, P81
[8] FREUND R, 2004, P GRAMM SYST WEEK 20, P179
[9] FREUND R, 2005, LNCS, V3365, P36
[10] Freund R., 1994, MATH ASPECTS NATURAL, P97, DOI DOI 10.1142/97898144471330006

← 1 2 →