P Colonies Processing Strings

DOI10.3233/FI-2014-1090zbMATH Open1315.68126OpenAlexW1794597222MaRDI QIDQ5259259FDOQ5259259

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)

Cited In (7)

• P colonies and reaction systems
• The Abilities of P Colony Based Models in Robot Control
• A class of restricted P colonies with string environment
• P colonies. Survey
• P Colonies and Their Extensions
• From P Colonies to 2D P Colonies and Simulations of Multiagent Systems
• Two notes on APCol systems

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)