P Systems and Finite Automata

Abstract— In this paper, we integrate the traditional finitestate 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.

• Type: Conference
• Year: 2007
• Where: CISIS
• Authors: Xian Xu
• Keywords: CISIS 2007, Multiset Based Automata, Software Engineering, Traditional finitestate Automata, finite Automata