Results on catalytic and evolution-communication P systems
暂无分享,去创建一个
[1] Rudolf Freund,et al. GP Systems with Forbidding Context , 2002, Fundam. Informaticae.
[2] Rudolf Freund,et al. P Systems with Activated/Prohibited Membrane Channels , 2002, WMC-CdeA.
[3] Rudolf Freund,et al. From regulated rewriting to computing with membranes: collapsing hierarchies , 2004, Theor. Comput. Sci..
[4] Rudolf Freund,et al. On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars , 2001, MCU.
[5] Gheorghe Paun,et al. Membrane Computing , 2002, Natural Computing Series.
[6] Peter C. Chapin. Formal languages I , 1973, CSC '73.
[7] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[8] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[9] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[10] Vincenzo Manca,et al. P Systems with Boundary Rules , 2002, WMC-CdeA.
[11] Matteo Cavaliere. Evolution-Communication P Systems , 2002, WMC-CdeA.
[12] Fred Joseph Gruenberger,et al. Computing: An Introduction , 1969 .
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .