P colonies processing strings

DOI10.3233/FI-2014-1090MaRDI QIDQ5259259zbMATH OpenOpenAlexFDO

Authors Luděk Cienciala, Lucie Ciencialová, Erzsébet Csuhaj-Varjú

Publication date 26 June 2015

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2014-1090

zbMATH Keywords

recursively enumerable languageautomataP colonyjumping finite automata

Mathematics Subject Classification ID

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

Recommendations

• A class of restricted P colonies with string environment
• P Colonies and Their Extensions
• P colonies. Survey
• APCol systems with verifier agents
• Two notes on APCol systems

Cited in

(10)

• P colonies. Survey
• P colonies and reaction systems
• APCol systems with agent creation
• APCol systems with verifier agents
• From P Colonies to 2D P Colonies and Simulations of Multiagent Systems
• A class of restricted P colonies with string environment
• The abilities of P colony based models in robot control
• P Colonies and Their Extensions
• Two notes on APCol systems
• Generalized P colony automata and their relation to P automata

This page was built for publication: P colonies processing strings

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