Trading polarizations for labels in P systems with active membranes
暂无分享,去创建一个
[1] Gheorghe Paun. P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..
[2] G. Mauri,et al. Universality and Normal Forms on Membrane Systems , 2000 .
[3] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[4] Artiom Alhazov,et al. Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Matthias Jantzen,et al. Petri net algorithms in the theory of matrix grammars , 2005, Acta Informatica.
[7] Kamala Krithivasan,et al. Improved Results about Universality of P systems , 2002, Bull. EATCS.
[8] Mario J. Pérez-Jiménez,et al. Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.
[9] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..
[10] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[11] Vincenzo Manca,et al. P Systems with Boundary Rules , 2002, WMC-CdeA.
[12] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.
[13] Gheorghe Paun,et al. Computing with Membranes: An Introduction , 1999, Bull. EATCS.