On the properties of language classes defined by bounded reaction automata

DOI10.1016/J.TCS.2012.03.024zbMath1252.68180arXiv1201.3082OpenAlexW2081383229MaRDI QIDQ714826

Satoshi Kobayashi, Takashi Yokomori, Fumiya Okubo

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3082

zbMATH Keywords

closure propertyabstract family of languagesbiochemical reaction modelbounded reaction automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biochemistry, molecular biology (92C40)

Related Items (4)

Decomposition and factorization of chemical reaction transducers ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Theory of reaction automata: a survey ⋮ The computational capability of chemical reaction automata

Cites Work

• Reaction automata
• Minimization strategies for maximally parallel multiset rewriting systems
• On the computational complexity of P automata
• Events and modules in reaction systems
• Introducing time in reaction systems
• Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
• P and dP Automata: A Survey
• FUNCTIONS DEFINED BY REACTION SYSTEMS
• COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
• Membrane Computing
• Pushdown automata, multiset automata, and Petri nets
• Multiset processing. Mathematical, computer science, and molecular computing points of view
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the properties of language classes defined by bounded reaction automata