2 citations · 2 across the 3 of their papers we have counts for
3 papers · 1 filter
On the Properties of Language Classes Defined by Bounded Reaction Automata
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
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 lan…
Reaction Automata
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
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, w…
On the Hairpin Incompletion
Fumiya Okubo, Takashi Yokomori
Hairpin completion and its variant called bounded hairpin completion are operations on formal languages, inspired by a hairpin formation in molecular biology. Another variant calle…