Reaction automata working in sequential manner

DOI10.1051/ITA/2013047MaRDI QIDQ2877371zbMATH OpenOpenAlexFDO

Authors Fumiya Okubo

Publication date 22 August 2014

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2014__48_1_23_0/

zbMATH Keywords

models of biochemical reactionssequential reaction automataspace complexityTuring machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Theory of reaction automata: a survey
• Reaction automata
• On the properties of language classes defined by bounded reaction automata
• The computational capability of chemical reaction automata
• The computational capability of chemical reaction automata

Cited in

(6)

• Theory of reaction automata: a survey
• The computational capability of chemical reaction automata
• The computational capability of chemical reaction automata
• The computing power of determinism and reversibility in chemical reaction automata
• On the computational power of swarm automata using agents with position information
• On the properties of language classes defined by bounded reaction automata

This page was built for publication: Reaction automata working in sequential manner

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