Takashi Yokomori | Waseda University (original) (raw)
Uploads
Papers by Takashi Yokomori
Lecture Notes in Computer Science, Dec 1, 2003
arXiv (Cornell University), Jan 15, 2012
Algorithmic Learning Theory, Nov 8, 1993
Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E, 1981
Soft Computing, Apr 1, 2001
... PaÆun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer, 1998, etc.... more ... PaÆun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer, 1998, etc.). Still, the papers by ``the Canadian team'' (L. Kari, R. Kitto, G. Gloor) and by ``the UK team'' (GG Owenson, M. Amos, DA Hodgson, A. Gibbons) are explicitly meant to explain ...
... Series Editors Jaime G. Carbonell, Carnegie Mellon University, Pittsburgh, PA, USA Jorg Siekm... more ... Series Editors Jaime G. Carbonell, Carnegie Mellon University, Pittsburgh, PA, USA Jorg Siekmann, University of Saarland, Saarbrucken, Germany ... We are indebted to all members of the program committee: Nader Bshouty (Technion, Israel), Satoshi Kobayashi (Tokyo Denki ...
Hawaii International Conference on System Sciences, 1994
ABSTRACT
European Conference on Computational Learning Theory, Oct 27, 1994
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-la... more We introduce two subclasses of regular !-languages called local !-languages and recognizable !-languages, and give two learning algorithms for those subclasses. We also relate these results to the learning problem for the class of monadic logic programs.
Theoretical Computer Science, Jun 1, 2022
Springer eBooks, 2014
We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant... more We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant of reaction automata (RAs) studied in recent literature ([7-9]).
arXiv (Cornell University), Nov 21, 2011
Machines, Computations, and Universality, 1998
ABSTRACT In search for a universal splicing system, in this paper we present a Post system univer... more ABSTRACT In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our result with recent known results about the translation of universal Turing machines into splicing systems. 1 Introduction Since the possibility of molecular computing was shown by Adleman's pioneering work ([1]) which, in a test tube, experimentally solves a small instance of an NPcomplete problem, the theoretical formalization of such a new computing technology has been attracting much attention in computer science ([3][5][6][12][17]). One of the formal frameworks for molecular computations is the Tom Head's splicing system ( or H system ), which gives a theoretical foundation for computing based on DNA recombination. Tom Head's seminal work ([9]) on modeling DNA recombination as a splicing sys...
arXiv (Cornell University), Feb 17, 2011
Hairpin completion and its restricted variant called bounded hairpin completion are operations on... more Hairpin completion and its restricted variant called bounded hairpin completion are operations on formal languages, inspired by a hairpin formation in molecular biology. We introduce a new operation of this kind, called {\it hairpin incompletion} which is in fact an extension of bounded hairpin completion. Further, the hairpin incompletion operation provides a formal language theoretic framework that models a bio-molecular technique nowadays known as Whiplash PCR. We study the closure properties of language families under both the operation and its iterated version. We show that a family of languages closed under intersection with regular sets, concatenation with regular sets, and finite union is closed under iterated hairpin incompletion, and that a family of languages containing all linear languages and closed under circular permutation, left derivative and substitution is also closed under iterated hairpin incompletion.
Acta Informatica, Mar 24, 2022
Journal of Robotics, Networking and Artificial Life, 2018
Lecture Notes in Computer Science, Dec 1, 2003
arXiv (Cornell University), Jan 15, 2012
Algorithmic Learning Theory, Nov 8, 1993
Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E, 1981
Soft Computing, Apr 1, 2001
... PaÆun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer, 1998, etc.... more ... PaÆun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer, 1998, etc.). Still, the papers by ``the Canadian team'' (L. Kari, R. Kitto, G. Gloor) and by ``the UK team'' (GG Owenson, M. Amos, DA Hodgson, A. Gibbons) are explicitly meant to explain ...
... Series Editors Jaime G. Carbonell, Carnegie Mellon University, Pittsburgh, PA, USA Jorg Siekm... more ... Series Editors Jaime G. Carbonell, Carnegie Mellon University, Pittsburgh, PA, USA Jorg Siekmann, University of Saarland, Saarbrucken, Germany ... We are indebted to all members of the program committee: Nader Bshouty (Technion, Israel), Satoshi Kobayashi (Tokyo Denki ...
Hawaii International Conference on System Sciences, 1994
ABSTRACT
European Conference on Computational Learning Theory, Oct 27, 1994
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-la... more We introduce two subclasses of regular !-languages called local !-languages and recognizable !-languages, and give two learning algorithms for those subclasses. We also relate these results to the learning problem for the class of monadic logic programs.
Theoretical Computer Science, Jun 1, 2022
Springer eBooks, 2014
We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant... more We propose a new computing model called chemical reaction automata (CRAs) as a simplified variant of reaction automata (RAs) studied in recent literature ([7-9]).
arXiv (Cornell University), Nov 21, 2011
Machines, Computations, and Universality, 1998
ABSTRACT In search for a universal splicing system, in this paper we present a Post system univer... more ABSTRACT In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our result with recent known results about the translation of universal Turing machines into splicing systems. 1 Introduction Since the possibility of molecular computing was shown by Adleman's pioneering work ([1]) which, in a test tube, experimentally solves a small instance of an NPcomplete problem, the theoretical formalization of such a new computing technology has been attracting much attention in computer science ([3][5][6][12][17]). One of the formal frameworks for molecular computations is the Tom Head's splicing system ( or H system ), which gives a theoretical foundation for computing based on DNA recombination. Tom Head's seminal work ([9]) on modeling DNA recombination as a splicing sys...
arXiv (Cornell University), Feb 17, 2011
Hairpin completion and its restricted variant called bounded hairpin completion are operations on... more Hairpin completion and its restricted variant called bounded hairpin completion are operations on formal languages, inspired by a hairpin formation in molecular biology. We introduce a new operation of this kind, called {\it hairpin incompletion} which is in fact an extension of bounded hairpin completion. Further, the hairpin incompletion operation provides a formal language theoretic framework that models a bio-molecular technique nowadays known as Whiplash PCR. We study the closure properties of language families under both the operation and its iterated version. We show that a family of languages closed under intersection with regular sets, concatenation with regular sets, and finite union is closed under iterated hairpin incompletion, and that a family of languages containing all linear languages and closed under circular permutation, left derivative and substitution is also closed under iterated hairpin incompletion.
Acta Informatica, Mar 24, 2022
Journal of Robotics, Networking and Artificial Life, 2018