On three classes of automata-like P systems

DOI10.1007/3-540-45007-6_23MaRDI QIDQ4452070zbMATH OpenFDO

Authors Rudolf Freund, Carlos Martín-Vide, Adam Obtułowicz, Gheorghe Păun

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100292.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• P automata revisited
• On a class ofPautomata
• On the power of P automata
• Membrane Computing
• P automata with restricted power

Cited in

(8)

• Minimizing evolution communication P systems and automata
• P transducers
• P Automata: Membrane Systems as Acceptors
• ON STATELESS AUTOMATA AND P SYSTEMS
• P automata or purely communicating accepting P systems
• On a class ofPautomata
• Variants of tissue P systems with prescribed teams of channel rules
• On the computational complexity of P automata

This page was built for publication: On three classes of automata-like P systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452070)