P Systems and Finite Automata

Abstract

In this paper, we integrate the traditional finite-state automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrated on multiset based automata. We apply P systems with string objects (worms) to implement finite automata, that is, simulating their running, showing that P systems with string objects can properly hold the computability of finite automata. We give the concept of P system with string objects and finite automata, describe the implementation details, and finally make some future work expectation