Reaction automata

Authors:
Fumiya Okubo;Satoshi Kobayashi;Takashi Yokomori
Affiliations:
Graduate School of Education, Waseda University, 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo 169-8050, Japan;Graduate School of Informatics and Engineering, University of Electro-Communications, 1-5-1 Chofugaoka, Chofu-shi, Tokyo 182-8585, Japan;Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo 169-8050, Japan
Venue:
Theoretical Computer Science
Year:
2012

Citing 15
Cited 1

A variant of random context grammars: semi-conditional grammars

Theoretical Computer Science
Computing with membranes

Journal of Computer and System Sciences
Pushdown automata, multiset automata, and Petri nets

Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Multiset Automata

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Reaction Systems

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Events and modules in reaction systems

Theoretical Computer Science
Computation with finite stochastic chemical reaction networks

Natural Computing: an international journal
Introducing time in reaction systems

Theoretical Computer Science
Multiset Pushdown Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Minimization strategies for maximally parallel multiset rewriting systems

Theoretical Computer Science
Spiking Neural dP Systems

Fundamenta Informaticae

On the properties of language classes defined by bounded reaction automata

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction automata are computationally Turing universal. Further, some subclasses of reaction automata with space complexity are investigated and their language classes are compared to the ones in the Chomsky hierarchy.