| Publication | Date of Publication | Type |
|---|
On approximately identifying concept classes in the limit
Lecture Notes in Computer Science | 2023-12-08 | Paper |
Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences
| 2023-02-07 | Paper |
Reducing control alphabet size for the control of right linear grammars with unknown behaviors
Theoretical Computer Science | 2021-03-09 | Paper |
Monotonically controlling right linear grammars with unknown behaviors to output a target string
Theoretical Computer Science | 2019-06-18 | Paper |
Molecular computers for molecular robots as hybrid systems
Theoretical Computer Science | 2016-05-27 | Paper |
Enumeration approach to computing chemical equilibria
Theoretical Computer Science | 2014-01-10 | Paper |
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science | 2012-10-11 | Paper |
Reaction automata
Theoretical Computer Science | 2012-05-30 | Paper |
Necessary and sufficient conditions for learning with correction queries
Theoretical Computer Science | 2009-11-06 | Paper |
Aspects of Molecular Computing
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences
DNA Computing | 2009-04-02 | Paper |
A New Translation for Semi-classical Theories — Backtracking without CPS
Functional and Logic Programming | 2008-04-11 | Paper |
A Characterization of the Language Classes Learnable with Correction Queries
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
DNA Computing
Lecture Notes in Computer Science | 2006-10-19 | Paper |
scientific article; zbMATH DE number 2087507 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087030 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2077175 (Why is no real title available?)
| 2004-07-01 | Paper |
DNA sequence design using templates
New Generation Computing | 2003-10-20 | Paper |
scientific article; zbMATH DE number 1953219 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1836430 (Why is no real title available?)
| 2002-11-27 | Paper |
Sticker systems with complex structures
Soft Computing | 2002-07-25 | Paper |
Formal properties of PA-matching
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1670720 (Why is no real title available?)
| 2001-11-11 | Paper |
Multiple splicing systems and the universal computability
Theoretical Computer Science | 2001-08-20 | Paper |
Horn clause computation with DNA molecules
Journal of Combinatorial Optimization | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1342114 (Why is no real title available?)
| 1999-09-22 | Paper |
scientific article; zbMATH DE number 1301791 (Why is no real title available?)
| 1999-06-16 | Paper |
Tree adjoining grammars for RNA structure prediction
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1231518 (Why is no real title available?)
| 1998-12-13 | Paper |
Learning approximately regular languages with reversible languages
Theoretical Computer Science | 1998-10-22 | Paper |
scientific article; zbMATH DE number 1104343 (Why is no real title available?)
| 1998-09-08 | Paper |
Monad as modality
Theoretical Computer Science | 1998-07-23 | Paper |
FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
International Journal of Foundations of Computer Science | 1997-08-07 | Paper |
A NEW FORMALIZATION OF FEFERMAN’S SYSTEM OF FUNCTIONS AND CLASSES AND ITS RELATION TO FREGE STRUCTURE
International Journal of Foundations of Computer Science | 1995-12-03 | Paper |
Realizability interpretation of generalized inductive definitions
Theoretical Computer Science | 1994-12-05 | Paper |
scientific article; zbMATH DE number 4101177 (Why is no real title available?)
| 1989-01-01 | Paper |
