13th International Conference on Membrane Computing - MTA Sztaki

B. Nagy
11. M. Hirversalo, Quantum Computing, Natural Computing Series, (2nd edition),
Springer, (2003)
12. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and
Computation, Addison-Wesley, Reading MA, (1979)
13. T.-O. Ishdorj, Minimal Parallelism for Polarizationless P Systems, DNA 12, LNCS
4287, pp. 17-32, (2006)
14. D. S. Johnson, A Catalog of Complexity Classes, in: Handbook of Theoretical
Computer Science, Volume A, Algorithms and Complexity, (ed: J. van Leeuwen),
Elsevier, (1990)
15. R. Karp, Reducibility Among Combinatorial Problems, Proceedings of a Symposium
on the Complexity of Computer Computations (R. E. Miller, J. W. Thatcher
eds.), Plenum Press, New York, pp. 85–103. (1972)
16. S.N. Krishna, K. Lakshmanan, R. Rama, On the power of P systems with contextual
rules, Fundamenta Informaticae 49, 167–178 (2002)
17. G. Kusper, Solving the resolution-free SAT problem by submodel propagation in
linear time, Ann. Math. Artif. Intell. 43 (1), 129–136 (2005)
18. A. Leporati, G. Mauri, C. Zandron, Quantum sequential P systems with unit rules
and energy assigned to membranes, in: R. Freund, Gh. Păun, G. Rozenberg, A.
Salomaa (Eds.), Membrane Computing: 6th <strong>International</strong> Workshop, WMC 2005,
Vienna, Austria, 1821 July, 2005, in: LNCS, 3850, Springer-Verlag, Berlin, pp.
310-325 (2006)
19. A. Leporati, S. Felloni, Three “quantum” algorithms to solve 3-SAT, Theoretical
Computer Science 372, 218-241 (2007)
20. P. Linz, An Introduction to Formal Languages and Automata, D.C. Heath and Co.,
(1990)
21. V. Manca, DNA and Membrane Algorithms for SAT, Fundamenta Informaticae 49
(1–3), 205–221. (2002)
22. N. Murphy, D. Woods, The computational complexity of uniformity and semiuniformity
in membrane systems, In BWMC7, volume 2, pages 73–84 (2009)
23. B. Nagy, The languages of SAT and n-SAT over finitely many variables are regular,
Bulletin of the EATCS 82, 286–297 (2004)
24. B. Nagy, An interval-valued computing device, CiE 2005, Computability in Europe:
New Computational Paradigms, Amsterdam, Netherlands, (X-2005-01) 166–177
(2005)
25. B. Nagy, S. Vályi, Interval-valued computations and their connection with
PSPACE, Theoretical Computer Science 394, 208–222 (2008)
26. B. Nagy, Effective Computing by Interval-values, INES 2010, 14th IEEE <strong>International</strong>
<strong>Conference</strong> on Intelligent Engineering Systems 2010, Las Palmas of Gran
Canaria, Spain, 91–96 (2010)
27. B. Nagy, S. Vályi, Prime factorization by interval-valued computing, Publicationes
Mathematicae Debrecen 79/3–4, 539–551 (2011)
28. L. Pan, A. Alhazov, Solving HPP and SAT by P Systems with Active Membranes
and Separation Rules, Acta Informatica 43 (2), 131–145 (2006)
29. C. H. Papadimitriu, Computational complexity, Addison-Wesley (1994)
30. Gh. Paun The propositional calculus languages versus the Chomsky hierarchy, Stud.
Cerc. Mat. 33, 299–310. (1981) (In Romanian)
31. Gh. Paun, Computing with Membranes, Journal of Computer and System Sciences,
61, 1, 108–143 (2000) and Turku Center for Computer Science-TUCS Report No.
208 (1998)
338