Abstract
AbstractWe investigate the computational power of non-cooperative polymorphic P systems with no additional ingredients. The variants we study are even more simple in the sense that the sets of possible right-hand sides of the dynamically changing rules are finite. We show that systems with this type of restriction characterize exactly the class of Parikh sets of ET0L languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Paper Title
Journal
Date
