Deterministic computation in chemical reaction automata
-
- Okubo Fumiya
- Principal Investigator
- 九州大学
About this project
- Japan Grant Number
- JP16K16008
- Funding Program
- Grants-in-Aid for Scientific Research
- Funding organization
- Japan Society for the Promotion of Science
- Project/Area Number
- 16K16008
- Research Category
- Grant-in-Aid for Young Scientists (B)
- Allocation Type
-
- Multi-year Fund
- Review Section / Research Field
-
- Integrated Disciplines > Informatics > Principles of Informatics > Theory of informatics
- Research Institution
-
- Kyushu University
- Nihon Pharmaceutical University
- Takachiho University
- Project Period (FY)
- 2016-04-01 〜 2023-03-31
- Project Status
- Completed
- Budget Amount*help
- 3,770,000 Yen (Direct Cost: 2,900,000 Yen Indirect Cost: 870,000 Yen)
Research Abstract
In order to clarify the properties of deterministic models in multiset rewriting systems in which the computation for an input symbolic sequence is uniquely determined, we defined determinism for chemical reaction automata in which reactions are applied sequentially. As a fundamental property, we found that the accepted language of deterministic chemical reaction automata is an incomparable relation with a well-known formal language, the context-free language. In order to synthesize deterministic chemical reaction automata that achieve the desired behavior, we defined the synthesis and decomposition of chemical reaction automata, and clarified the conditions under which they can be realizeed.
Keywords
Details 詳細情報について
-
- CRID
- 1040282256899380608
-
- Text Lang
- ja
-
- Data Source
-
- KAKEN