The following pages link to Satoshi Kobayashi (Q391181):
Displayed 39 items.
- Item:Q391181 (redirect page) (← links)
- Item:Q391181 (redirect page) (← links)
- Molecular computers for molecular robots as hybrid systems (Q288808) (← links)
- Enumeration approach to computing chemical equilibria (Q391182) (← links)
- Reaction automata (Q418799) (← links)
- Item:Q391181 (redirect page) (← links)
- DNA sequence design using templates (Q698884) (← links)
- On the properties of language classes defined by bounded reaction automata (Q714826) (← links)
- Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
- Learning approximately regular languages with reversible languages (Q1269920) (← links)
- Tree adjoining grammars for RNA structure prediction (Q1274602) (← links)
- Horn clause computation with DNA molecules (Q1306406) (← links)
- Realizability interpretation of generalized inductive definitions (Q1331920) (← links)
- Monad as modality (Q1392142) (← links)
- Sticker systems with complex structures (Q1606780) (← links)
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors (Q1998876) (← links)
- Monotonically controlling right linear grammars with unknown behaviors to output a target string (Q2422039) (← links)
- (Q2754010) (← links)
- FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA (Q3126016) (← links)
- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences (Q3618688) (← links)
- (Q3826550) (← links)
- (Q4222832) (← links)
- (Q4247007) (← links)
- (Q4263695) (← links)
- (Q4370216) (← links)
- (Q4414681) (← links)
- (Q4470568) (← links)
- (Q4737672) (← links)
- (Q4738307) (← links)
- (Q4782115) (← links)
- A NEW FORMALIZATION OF FEFERMAN’S SYSTEM OF FUNCTIONS AND CLASSES AND ITS RELATION TO FREGE STRUCTURE (Q4853337) (← links)
- A Characterization of the Language Classes Learnable with Correction Queries (Q5425451) (← links)
- A New Translation for Semi-classical Theories — Backtracking without CPS (Q5458438) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493036) (← links)
- DNA Computing (Q5494354) (← links)
- Aspects of Molecular Computing (Q5901839) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- Formal properties of PA-matching (Q5958115) (← links)
- On approximately identifying concept classes in the limit (Q6061901) (← links)