Satoshi Kobayashi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Satoshi Kobayashi has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Takashi Yokomori
Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, Tokyo, Japan
3 shared publications - Fumiya Okubo
Graduate School of Education, Waseda University, 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo 169-8050, Japan
2 shared publications - Masami Hagiya
The University of Tokyo
2 shared publications - Takashi Yokomori
Waseda University
2 shared publications - Akihiko Konagaya
Tokyo Institute of Technology
1 shared publication - Fumiaki Tanaka
The University of Tokyo
1 shared publication
Latest Publications
- 1 August 2013
- Published by Elsevier in Theoretical Computer Science
- Vol. 499, 51-87
Enumeration approach to computing chemical equilibria
- 1 August 2013
- Published by Elsevier in Theoretical Computer Science
- Vol. 499, 51-87
Enumeration approach to computing chemical equilibria
- Open Access
- 1 January 2013
- Published by Springer Nature in New Generation Computing
- Vol. 31 (1) , 27-45
Molecular Robotics: A New Paradigm for Artifacts
- 1 January 2013
- Published by Springer Nature in New Generation Computing
- Vol. 31 (1) , 27-45
Open AccessMolecular Robotics: A New Paradigm for Artifacts
- Open Access
On the Properties of Language Classes Defined by Bounded Reaction Automata
Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linearbounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by lambda-LRAs) by allowing lambda-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and lambda-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following : (i) the class of languages accepted by lambda-LRAs forms an AFL with additional closure properties, (ii) any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA, (iii) the class of languages accepted by ERAs coincides with the class of context-sensitive languages.
Open AccessOn the Properties of Language Classes Defined by Bounded Reaction Automata
Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linearbounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by lambda-LRAs) by allowing lambda-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and lambda-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following : (i) the class of languages accepted by lambda-LRAs forms an AFL with additional closure properties, (ii) any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA, (iii) the class of languages accepted by ERAs coincides with the class of context-sensitive languages.
- 1 January 2012
- Published by Springer Nature
- p. 1129-1184
Molecular Computing Machineries — Computing Models and Wet Implementations
- 1 January 2012
- Published by Springer Nature
- p. 1129-1184
Molecular Computing Machineries — Computing Models and Wet Implementations
- Open Access
Reaction Automata
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.
Open AccessReaction Automata
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.
- 13 August 2009
- Published by Springer Nature
- p. 159-183
Applying Symmetric Enumeration Method to One-Dimensional Assembly of Rotatable Tiles
- 13 August 2009
- Published by Springer Nature
- p. 159-183
Applying Symmetric Enumeration Method to One-Dimensional Assembly of Rotatable Tiles
- 1 September 2002
- Published by Springer Nature in New Generation Computing
- Vol. 20 (3) , 263-277
DNA sequence design using templates
- 1 September 2002
- Published by Springer Nature in New Generation Computing
- Vol. 20 (3) , 263-277
DNA sequence design using templates
- 14 February 2002
- Published by Springer Nature
- p. 418-429
A Magic Pot : Self-assembly Computation Revisited
- 14 February 2002
- Published by Springer Nature
- p. 418-429
A Magic Pot : Self-assembly Computation Revisited
- 1 January 2001
- Published by Springer Nature
- p. 277-286
Approximate Identification and Finite Elasticity
- 1 January 2001
- Published by Springer Nature
- p. 277-286
Approximate Identification and Finite Elasticity