default search action
Takashi Yokomori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j47]Kaoru Fujioka
, Fumiya Okubo, Takashi Yokomori:
ℒ-reduction computation revisited. Acta Informatica 59(4): 409-426 (2022) - [j46]Fumiya Okubo
Chemical Reaction Regular Grammars. New Gener. Comput. 40(2): 659-680 (2022) - [j45]Fumiya Okubo, Takashi Yokomori:
Corrigendum to "On the computing powers of L-reductions of insertion languages" [Theor. Comput. Sci. 862 (2021) 224-235]. Theor. Comput. Sci. 920: 113 (2022) - 2021
- [j44]Takashi Yokomori
Theory of reaction automata: a survey. J. Membr. Comput. 3(1): 63-85 (2021) - [j43]Fumiya Okubo, Takashi Yokomori:
On the computing powers of L-reductions of insertion languages. Theor. Comput. Sci. 862: 224-235 (2021)
2010 – 2019
- 2019
- [j42]Fumiya Okubo, Takashi Yokomori:
Decomposition and factorization of chemical reaction transducers. Theor. Comput. Sci. 777: 431-442 (2019) - 2018
- [j41]Takashi Yokomori:
Natural Computing Paradigm • A Concise Introduction. J. Robotics Netw. Artif. Life 5(1): 6-9 (2018) - [c35]Takashi Yokomori, Fumiya Okubo:
Computing with Multisets: A Survey on Reaction Automata Theory. CiE 2018: 421-431 - [p2]Fumiya Okubo, Takashi Yokomori:
The Computing Power of Determinism and Reversibility in Chemical Reaction Automata. Reversibility and Universality 2018: 279-298 - 2017
- [j40]Fumiya Okubo, Takashi Yokomori:
Morphic Characterizations of Language Families Based on Local and Star Languages. Fundam. Informaticae 154(1-4): 323-341 (2017) - 2016
- [j39]Fumiya Okubo, Takashi Yokomori:
The computational capability of chemical reaction automata. Nat. Comput. 15(2): 215-224 (2016) - 2015
- [j38]Fumiya Okubo, Takashi Yokomori:
Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy. Fundam. Informaticae 138(1-2): 31-44 (2015) - 2014
- [c34]Fumiya Okubo, Takashi Yokomori:
The Computational Capability of Chemical Reaction Automata. DNA 2014: 53-66 - 2012
- [j37]Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori:
Reaction automata. Theor. Comput. Sci. 429: 247-257 (2012) - [j36]Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori:
On the properties of language classes defined by bounded reaction automata. Theor. Comput. Sci. 454: 206-221 (2012) - [p1]Masami Hagiya, Satoshi Kobayashi, Ken Komiya
Molecular Computing Machineries - Computing Models and Wet Implementations. Handbook of Natural Computing 2012: 1129-1184 - [i3]Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori:
On the Properties of Language Classes Defined by Bounded Reaction Automata. CoRR abs/1201.3082 (2012) - 2011
- [j35]Fumiya Okubo, Takashi Yokomori:
On the Hairpin Incompletion. Fundam. Informaticae 110(1-4): 255-269 (2011) - [j34]Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez
Spiking Neural dP Systems. Fundam. Informaticae 111(4): 423-436 (2011) - [j33]Fumiya Okubo, Takashi Yokomori:
Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages. Int. J. Found. Comput. Sci. 22(1): 247-260 (2011) - [i2]Fumiya Okubo, Takashi Yokomori:
On the Hairpin Incompletion. CoRR abs/1102.3503 (2011) - [i1]Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori:
Reaction Automata. CoRR abs/1111.5038 (2011) - 2010
- [j32]Florin Manea, Victor Mitrana
Some Remarks on the Hairpin Completion. Int. J. Found. Comput. Sci. 21(5): 859-872 (2010) - [j31]Oscar H. Ibarra, Mario J. Pérez-Jiménez
On spiking neural P systems. Nat. Comput. 9(2): 475-491 (2010)
2000 – 2009
- 2009
- [j30]Florin Manea, Victor Mitrana
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. Theor. Comput. Sci. 410(4-5): 417-425 (2009) - [c33]Mario J. Pérez-Jiménez, Takashi Yokomori:
Membrane Computing Schema: A New Approach to Computation Using String Insertions. Algorithmic Bioprocesses 2009: 293-309 - 2008
- [j29]Gheorghe Paun, Mario J. Pérez-Jiménez
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems. Int. J. Found. Comput. Sci. 19(4): 859-871 (2008) - [j28]Kaoru Onodera, Takashi Yokomori:
Doubler and linearizer: an approach toward a unified theory for molecular computing based on DNA complementarity. Nat. Comput. 7(1): 125-143 (2008) - [j27]Chengde Mao, Takashi Yokomori:
Foreword. Nat. Comput. 7(2): 145-146 (2008) - [j26]Mihai Ionescu, Gheorghe Paun, Takashi Yokomori:
Preface. Nat. Comput. 7(4): 451-452 (2008) - [c32]Florin Manea, Victor Mitrana, Takashi Yokomori:
Some Remarks on the Hairpin Completion. AFL 2008: 302-313 - 2007
- [j25]Gheorghe Paun, Mihai Ionescu, Takashi Yokomori:
Spiking Neural P Systems with an Exhaustive Use of Rules. Int. J. Unconv. Comput. 3(2): 135-153 (2007) - [j24]Takashi Yokomori:
Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206]. Theor. Comput. Sci. 377(1-3): 282-283 (2007) - [c31]Yasubumi Sakakibara, Takashi Yokomori, Satoshi Kobayashi, Akira Suyama:
Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles. Formal Models, Languages and Applications 2007: 304-319 - [c30]Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori:
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems. DCFS 2007: 129-140 - 2006
- [j23]Mihai Ionescu, Gheorghe Paun, Takashi Yokomori:
Spiking Neural P Systems. Fundam. Informaticae 71(2-3): 279-308 (2006) - [e4]Chengde Mao, Takashi Yokomori:
DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4287, Springer 2006, ISBN 3-540-49024-8 [contents] - 2005
- [c29]Kaoru Onodera, Takashi Yokomori:
Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity. DNA 2005: 224-235 - 2004
- [j22]Gheorghe Paun, Yasuhiro Suzuki
On the power of membrane division in P systems. Theor. Comput. Sci. 324(1): 61-85 (2004) - [c28]Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara:
An Algorithm for Testing Structure Freeness of Biomolecular Sequences. Aspects of Molecular Computing 2004: 266-277 - [c27]Leonor Becerra-Bonache, Takashi Yokomori:
Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning. ICGI 2004: 53-64 - 2003
- [j21]Akihiro Takahara, Takashi Yokomori:
On the computational power of insertion-deletion systems. Nat. Comput. 2(4): 321-336 (2003) - [j20]Takashi Yokomori:
Polynomial-time identification of very simple grammars from positive data. Theor. Comput. Sci. 298(1): 179-206 (2003) - 2002
- [j19]Takashi Yokomori:
Corrigendum Learning Two-Type Automata from Queries and Counterexamples. Theory Comput. Syst. 35(4): 465-466 (2002) - [c26]Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi:
A Magic Pot : Self-assembly Computation Revisited. Formal and Natural Computing 2002: 418-430 - [c25]Akihiro Takahara, Takashi Yokomori:
On the Computational Power of Insertion-Deletion Systems. DNA 2002: 269-280 - 2001
- [j18]Gheorghe Paun, Grzegorz Rozenberg, Takashi Yokomori:
Hairpin Languages. Int. J. Found. Comput. Sci. 12(6): 837-847 (2001) - [j17]Gheorghe Paun, Takashi Yokomori:
Toward Soft Hardware. Soft Comput. 5(2): 93-94 (2001) - [c24]Satoshi Kobayashi, Yasubumi Sakakibara, Takashi Yokomori:
Approximate identification of finite elasticity. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 277-286 - 2000
- [j16]Gheorghe Paun, Takashi Yokomori:
Simulating H Systems by P Systems. J. Univers. Comput. Sci. 6(1): 178-193 (2000) - [j15]Claudio Ferretti
On the universality of Post and splicing systems. Theor. Comput. Sci. 231(2): 157-170 (2000)
1990 – 1999
- 1999
- [j14]Yasuo Uemura, Aki Hasegawa, Satoshi Kobayashi, Takashi Yokomori:
Tree Adjoining Grammars for RNA Structure Prediction. Theor. Comput. Sci. 210(2): 277-303 (1999) - [c23]Takashi Yokomori:
YAC: Yet another computation model of self-assembly. DNA Based Computers 1999: 155-169 - [c22]Gheorghe Paun, Takashi Yokomori:
Membrane computing based on splicing. DNA Based Computers 1999: 217-231 - [c21]Takashi Yokomori:
Computation = self-assembly + conformational change: toward new computing paradigms. Developments in Language Theory 1999: 32-43 - [e3]Osamu Watanabe, Takashi Yokomori:
Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings. Lecture Notes in Computer Science 1720, Springer 1999, ISBN 3-540-66748-2 [contents] - 1998
- [j13]Takashi Yokomori, Satoshi Kobayashi:
Learning Local Languages and Their Application to DNA Sequence Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 20(10): 1067-1079 (1998) - [c20]Tom Head, Satoshi Kobayashi, Takashi Yokomori:
Locality, Reversibility, and Beyond: Learning Languages from Positive Data. ALT 1998: 191-204 - [c19]Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori:
On the Universality of Post and Splicing Systems. MCU (2) 1998: 12-28 - 1997
- [j12]Satoshi Kobayashi, Takashi Yokomori:
Learning Approximately Regular Languages with Reversible Languages. Theor. Comput. Sci. 174(1-2): 251-257 (1997) - [c18]Satoshi Kobayashi, Takashi Yokomori:
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. ALT 1997: 48-61 - [c17]Takashi Yokomori, Satoshi Kobayashi:
DNA-EC: A model of DNA-computing based on equality checking. DNA Based Computers 1997: 347-360 - 1996
- [j11]Satoshi Kobayashi, Takashi Yokomori:
Families of Noncounting Languages and Their Learnability from Positive Data. Int. J. Found. Comput. Sci. 7(4): 309-328 (1996) - [j10]Takashi Yokomori:
Learning Two-Tape Automata from Queries and Counterexamples. Math. Syst. Theory 29(3): 259-270 (1996) - 1995
- [j9]Takashi Yokomori:
Foreword. IEICE Trans. Inf. Syst. 78-D(5): 517 (1995) - [j8]Takashi Yokomori:
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata. Mach. Learn. 19(2): 153-179 (1995) - [c16]Satoshi Kobayashi, Takashi Yokomori:
On Approximately Identifying Concept Classes in the Limit. ALT 1995: 298-312 - 1994
- [c15]Satoshi Kobayashi, Takashi Yokomori:
Learning Concatenations of Locally Testable Languages from Positive Data. AII/ALT 1994: 407-422 - [c14]Noriyuki Tanida, Takashi Yokomori:
Inductive Inference of Monogenic Pure Context-free Languages. AII/ALT 1994: 560-573 - [c13]Takashi Yokomori, Nobuyuki Ishida, Satoshi Kobayashi:
Learning Local Languages and its Application to Protein \alpha-Chain Identification. HICSS (5) 1994: 113-122 - 1993
- [c12]Takashi Yokomori:
Learning Two-Tape Automata from Queries and Counterexamples. COLT 1993: 228-235 - [c11]Ahmed Saoudi, Takashi Yokomori:
Learning local and recognizable Ω-languages and monadic logic programs. EuroCOLT 1993: 157-169 - [e2]Klaus P. Jantke
Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings. Lecture Notes in Computer Science 744, Springer 1993, ISBN 3-540-57370-4 [contents] - 1992
- [c10]Takashi Yokomori:
On Learning Systolic Languages. ALT 1992: 41-52 - [c9]Takashi Yokomori:
Learning non-deterministic finite automata from queries and counterexamples. Machine Intelligence 13 1992: 169-189 - 1991
- [c8]Noriyuki Tanida, Takashi Yokomori:
Polynomial-time identification of very regular languages in the limit. ALT 1991: 61-72 - [c7]Takashi Yokomori:
Polynomial-Time Learning of Very Simple Grammars from Positive Data. COLT 1991: 213-227 - 1990
- [e1]Setsuo Arikawa, Shigeki Goto, Setsuo Ohsuga, Takashi Yokomori:
Algorithmic Learning Theory, First International Workshop, ALT '90, Tokyo, Japan, October 8-10, 1990, Proceedings. Springer/Ohmsha 1990, ISBN 3-540-19661-7 [contents]
1980 – 1989
- 1989
- [c6]Takashi Yokomori:
Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan. AII 1989: 104-123 - 1987
- [j7]Takashi Yokomori:
Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language. New Gener. Comput. 5(3): 227-248 (1987) - [j6]Takashi Yokomori:
On Purely Morphic Characterizations of Context-Free Languages. Theor. Comput. Sci. 51: 301-308 (1987) - [c5]Takashi Yokomori:
Inductive Inference of Context-free Languages - Context-free Expression Method. IJCAI 1987: 283-286 - 1986
- [j5]Takashi Yokomori:
Logic Program Forms. New Gener. Comput. 4(3): 305-319 (1986) - [c4]Takashi Yokomori:
On Analogical Query Processing in Logic Database. VLDB 1986: 376-383 - 1985
- [c3]Takashi Yokomori:
A Logic Program Schema and Its Applications. IJCAI 1985: 723-725 - [c2]Jiro Tanaka, Takashi Yokomori, Makoto Kishishita:
AND-OR Queuing in Extended Concurrent Prolog. LP 1985: 156-167 - 1984
- [j4]Takashi Yokomori, Derick Wood:
An Inverse Homomorphic Characterization of Full Principal AFL. Inf. Sci. 33(3): 209-215 (1984) - [c1]Takashi Yokomori:
A Note on the Set Abstraction in Logic Programming Language. FGCS 1984: 333-340 - 1983
- [j3]Takashi Yokomori, Aravind K. Joshi:
Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages. Inf. Process. Lett. 17(3): 137-143 (1983) - 1982
- [j2]Takashi Yokomori, Derick Wood, Klaus-Jörn Lange:
A Three-Restricted Normal Form Theorem for ET0L Languages. Inf. Process. Lett. 14(3): 97-100 (1982) - 1980
- [j1]Takashi Yokomori:
Stochastic Characterizations of EOL Languages. Inf. Control. 45(1): 26-33 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: