On the Computational Complexity of P Automata
- 1 May 2006
- journal article
- Published by Springer Nature in Natural Computing
- Vol. 5 (2) , 109-126
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the computational complexity of membrane systemsTheoretical Computer Science, 2004
- On a class ofPautomataInternational Journal of Computer Mathematics, 2003
- On Three Classes of Automata-Like P SystemsLecture Notes in Computer Science, 2003
- The power of communication: P systems with symport/antiportNew Generation Computing, 2002
- Membrane Computing2002
- Turing machines with restricted memory accessInformation and Control, 1966