On Bounded Symport/Antiport P Systems

DOI10.1007/11753681_10zbMath1234.68112OpenAlexW1574891808MaRDI QIDQ3618684

Sara Woodworth, Oscar H. Ibarra

Publication date: 2 April 2009

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753681_10

zbMATH Keywords

deterministicTuring machinehierarchynondeterministicsymport/antiport systemmulticounter machinecommunicating P systemmultihead two-way finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems

Cites Work

• Unnamed Item
• The power of communication: P systems with symport/antiport
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient
• A guide to membrane computing.
• Relationships between nondeterministic and deterministic tape complexities
• A note on multihead automata and context-sensitive languages
• On determinism versus nondeterminism in P systems
• Unconventional Computation
• Membrane Computing

This page was built for publication: On Bounded Symport/Antiport P Systems