P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA

DOI10.1142/S0129054113400273zbMath1293.68183OpenAlexW2058117339MaRDI QIDQ5495416

Erzsébet Csuhaj-Varjú

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400273

zbMATH Keywords

membrane systemsP automatadP automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

P colonies. Survey

Cites Work

• An infinite hierarchy of languages defined by dP systems
• On the computational complexity of membrane systems
• Complexity of multi-head finite automata: origins and directions
• The power of communication: P systems with symport/antiport
• P automata revisited
• (Mem)brane automata
• Classes of regular and context-free languages over countably infinite alphabets
• Finite-memory automata
• Computing with membranes
• On membrane hierarchy in P systems
• Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems

This page was built for publication: P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA