Takashi Yokomori
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
Takashi Yokomori has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Fumiya Okubo
Graduate School of Education, Waseda University, 1-6-1 Nishiwaseda, Shinjuku-ku, Tokyo 169-8050, Japan
5 shared publications - Fumiya Okubo
Faculty of Arts and Science, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka 819-0395, Japan
4 shared publications - Satoshi Kobayashi
University of Electro-Communications
3 shared publications - Fumiya Okubo
Kyushu University
2 shared publications - Gheorghe Păun
Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700 Bucharest, Romania
2 shared publications - Kaoru Fujioka
Fukuoka Women’s University
2 shared publications
Latest Publications
- 24 March 2022
- Published by Springer Nature in Acta Informatica
- Vol. 59 (4) , 409-426
$\mathcal {L}$-reduction computation revisited- 24 March 2022
- Published by Springer Nature in Acta Informatica
- Vol. 59 (4) , 409-426
$\mathcal {L}$-reduction computation revisited- 10 March 2022
- Published by Springer Nature in New Generation Computing
- Vol. 40 (2) , 659-680
Chemical Reaction Regular Grammars
- 10 March 2022
- Published by Springer Nature in New Generation Computing
- Vol. 40 (2) , 659-680
Chemical Reaction Regular Grammars
- 9 March 2021
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 3 (1) , 63-85
Theory of reaction automata: a survey
- 9 March 2021
- Published by Springer Nature in Journal of Membrane Computing
- Vol. 3 (1) , 63-85
Theory of reaction automata: a survey
- 3 July 2018
- Published by Springer Nature
- p. 421-431
Computing with Multisets: A Survey on Reaction Automata Theory
- 3 July 2018
- Published by Springer Nature
- p. 421-431
Computing with Multisets: A Survey on Reaction Automata Theory
- 27 February 2018
- Published by Springer Nature
- p. 279-298
The Computing Power of Determinism and Reversibility in Chemical Reaction Automata
- 27 February 2018
- Published by Springer Nature
- p. 279-298
The Computing Power of Determinism and Reversibility in Chemical Reaction Automata
- 9 August 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 154 (1-4) , 323-341
Morphic Characterizations of Language Families Based on Local and Star Languages
New morphic characterizations in the form of a noted Chomsky-Schützenberger theorem are established for the classes of regular languages, of context-free languages and of languages accepted by chemical reaction automata. Our results include the follo
- 9 August 2017
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 154 (1-4) , 323-341
Morphic Characterizations of Language Families Based on Local and Star Languages
New morphic characterizations in the form of a noted Chomsky-Schützenberger theorem are established for the classes of regular languages, of context-free languages and of languages accepted by chemical reaction automata. Our results include the follo
- 2 June 2015
- Published by Springer Nature in Natural Computing
- Vol. 15 (2) , 215-224
The computational capability of chemical reaction automata
- 2 June 2015
- Published by Springer Nature in Natural Computing
- Vol. 15 (2) , 215-224
The computational capability of chemical reaction automata
- 1 June 2015
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 138 (1-2) , 31-44
Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy
This paper concerns new characterizations of language classes in the Chomsky hierarchy in terms of a new type of computing device called FAMM (Finite Automaton with Multiset Memory) in which a multiset of symbol objects is available for the storage of working space. Unlike the stack or the tape for a storage, the multiset might seem to be less powerful in computing task, due to the lack of positional (structural) information of stored data. We introduce the class of FAMMs of degree d (for non-negative integer d) in general form, and investigate the computing powers of some subclasses of those FAMMs. We show that the classes of languages accepted by FAMMs of degree 0, by FAMMs of degree 1, by exponentially-bounded FAMMs of degree 2, and by FAMMs of degree 2 are exactly the four classes of languages REG, CF, CS and RE in the Chomsky hierarchy, respectively. Thus, this unified view from multiset-based computing provides new insight into the computational aspects of the Chomsky hierarchy.
- 1 June 2015
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 138 (1-2) , 31-44
Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy
This paper concerns new characterizations of language classes in the Chomsky hierarchy in terms of a new type of computing device called FAMM (Finite Automaton with Multiset Memory) in which a multiset of symbol objects is available for the storage of working space. Unlike the stack or the tape for a storage, the multiset might seem to be less powerful in computing task, due to the lack of positional (structural) information of stored data. We introduce the class of FAMMs of degree d (for non-negative integer d) in general form, and investigate the computing powers of some subclasses of those FAMMs. We show that the classes of languages accepted by FAMMs of degree 0, by FAMMs of degree 1, by exponentially-bounded FAMMs of degree 2, and by FAMMs of degree 2 are exactly the four classes of languages REG, CF, CS and RE in the Chomsky hierarchy, respectively. Thus, this unified view from multiset-based computing provides new insight into the computational aspects of the Chomsky hierarchy.
- 30 July 2014
- Published by Springer Nature
- p. 1-22
Recent Developments on Reaction Automata Theory: A Survey
- 30 July 2014
- Published by Springer Nature
- p. 1-22
Recent Developments on Reaction Automata Theory: A Survey
- 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.