P and dP automata: unconventional versus classical automata

DOI10.1142/S0129054113400273MaRDI QIDQ5495416zbMATH OpenOpenAlexFDO

Authors 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

dP automatamembrane systemsP automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• P and dP automata: unconventional versus classical automata
• P automata: concepts, results, and new aspects
• P and dP automata: a survey
• On Counter Machines versus dP Automata
• On the power of P and dP automata

Cites work

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

Cited in

(7)

• P colonies. Survey
• P and dP automata: a survey
• P and dP automata: unconventional versus classical automata
• On the power of P and dP automata
• On Counter Machines versus dP Automata
• P automata: concepts, results, and new aspects
• P automata revisited

This page was built for publication: P and dP automata: unconventional versus classical automata

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