The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Takashi Yokomori: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Takashi Yokomori
    A Note on the Set Abstraction in Logic Programming Language. [Citation Graph (1, 0)][DBLP]
    FGCS, 1984, pp:333-340 [Conf]
  2. Takashi Yokomori
    A Logic Program Schema and Its Applications. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1985, pp:723-725 [Conf]
  3. Takashi Yokomori
    Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:104-123 [Conf]
  4. Tom Head, Satoshi Kobayashi, Takashi Yokomori
    Locality, Reversibility, and Beyond: Learning Languages from Positive Data. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:191-204 [Conf]
  5. Satoshi Kobayashi, Takashi Yokomori
    Learning Concatenations of Locally Testable Languages from Positive Data. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:407-422 [Conf]
  6. Satoshi Kobayashi, Takashi Yokomori
    On Approximately Identifying Concept Classes in the Limit. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:298-312 [Conf]
  7. Satoshi Kobayashi, Takashi Yokomori
    Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:48-61 [Conf]
  8. Noriyuki Tanida, Takashi Yokomori
    Inductive Inference of Monogenic Pure Context-free Languages. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:560-573 [Conf]
  9. Takashi Yokomori
    On Learning Systolic Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 1992, pp:41-52 [Conf]
  10. Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara
    An Algorithm for Testing Structure Freeness of Biomolecular Sequences. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:266-277 [Conf]
  11. Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi
    A Magic Pot : Self-assembly Computation Revisited. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:418-430 [Conf]
  12. Takashi Yokomori
    Polynomial-Time Learning of Very Simple Grammars from Positive Data. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:213-227 [Conf]
  13. Takashi Yokomori
    Learning Two-Tape Automata from Queries and Counterexamples. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:228-235 [Conf]
  14. Takashi Yokomori
    Computation = self-assembly + conformational change: toward new computing paradigms. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:32-43 [Conf]
  15. Akihiro Takahara, Takashi Yokomori
    On the Computational Power of Insertion-Deletion Systems. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:269-280 [Conf]
  16. Kaoru Onodera, Takashi Yokomori
    Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:224-235 [Conf]
  17. Takashi Yokomori, Nobuyuki Ishida, Satoshi Kobayashi
    Learning Local Languages and its Application to Protein \alpha-Chain Identification. [Citation Graph (0, 0)][DBLP]
    HICSS (5), 1994, pp:113-122 [Conf]
  18. Leonor Becerra-Bonache, Takashi Yokomori
    Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:53-64 [Conf]
  19. Takashi Yokomori
    Inductive Inference of Context-free Languages- Context-free Expression Method. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1987, pp:283-286 [Conf]
  20. Jiro Tanaka, Takashi Yokomori, Makoto Kishishita
    AND-OR Queuing in Extended Concurrent Prolog. [Citation Graph (0, 0)][DBLP]
    LP, 1985, pp:156-167 [Conf]
  21. Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori
    On the Universality of Post and Splicing Systems. [Citation Graph (0, 0)][DBLP]
    MCU (2), 1998, pp:12-28 [Conf]
  22. Takashi Yokomori
    Learning non-deterministic finite automata from queries and counterexamples. [Citation Graph (0, 0)][DBLP]
    Machine Intelligence 13, 1994, pp:169-189 [Conf]
  23. Takashi Yokomori
    On Analogical Query Processing in Logic Database. [Citation Graph (0, 11)][DBLP]
    VLDB, 1986, pp:376-383 [Conf]
  24. Mihai Ionescu, Gheorghe Paun, Takashi Yokomori
    Spiking Neural P Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:2-3, pp:279-308 [Journal]
  25. Takashi Yokomori
    Stochastic Characterizations of EOL Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:45, n:1, pp:26-33 [Journal]
  26. Satoshi Kobayashi, Takashi Yokomori
    Families of Noncounting Languages and Their Learnability from Positive Data. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:4, pp:309-0 [Journal]
  27. Gheorghe Paun, Grzegorz Rozenberg, Takashi Yokomori
    Hairpin Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2001, v:12, n:6, pp:837-847 [Journal]
  28. Takashi Yokomori, Aravind K. Joshi
    Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:3, pp:137-143 [Journal]
  29. Takashi Yokomori, Derick Wood, Klaus-Jörn Lange
    A Three-Restricted Normal Form Theorem for ET0L Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:3, pp:97-100 [Journal]
  30. Takashi Yokomori, Derick Wood
    An Inverse Homomorphic Characterization of Full Principal AFL. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1984, v:33, n:3, pp:209-215 [Journal]
  31. Gheorghe Paun, Takashi Yokomori
    Simulating H Systems by P Systems. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:1, pp:178-193 [Journal]
  32. Takashi Yokomori
    On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1995, v:19, n:2, pp:153-179 [Journal]
  33. Takashi Yokomori
    Corrigendum Learning Two-Type Automata from Queries and Counterexamples. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:4, pp:465-466 [Journal]
  34. Takashi Yokomori
    Learning Two-Tape Automata from Queries and Counterexamples. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:3, pp:259-270 [Journal]
  35. Akihiro Takahara, Takashi Yokomori
    On the computational power of insertion-deletion systems. [Citation Graph (0, 0)][DBLP]
    Natural Computing, 2003, v:2, n:4, pp:321-336 [Journal]
  36. Takashi Yokomori
    Logic Program Forms. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1986, v:4, n:3, pp:305-319 [Journal]
  37. Takashi Yokomori
    Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1987, v:5, n:3, pp:227-248 [Journal]
  38. Takashi Yokomori, Satoshi Kobayashi
    Learning Local Languages and Their Application to DNA Sequence Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1998, v:20, n:10, pp:1067-1079 [Journal]
  39. Gheorghe Paun, Takashi Yokomori
    Toward Soft Hardware. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2001, v:5, n:2, pp:93-94 [Journal]
  40. Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori
    On the universality of Post and splicing systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:2, pp:157-170 [Journal]
  41. Satoshi Kobayashi, Takashi Yokomori
    Learning Approximately Regular Languages with Reversible Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:251-257 [Journal]
  42. Gheorghe Paun, Yasuhiro Suzuki, Hiroshi Tanaka, Takashi Yokomori
    On the power of membrane division in P systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:1, pp:61-85 [Journal]
  43. Yasuo Uemura, Aki Hasegawa, Satoshi Kobayashi, Takashi Yokomori
    Tree Adjoining Grammars for RNA Structure Prediction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:2, pp:277-303 [Journal]
  44. Takashi Yokomori
    Polynomial-time identification of very simple grammars from positive data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:298, pp:179-206 [Journal]
  45. Takashi Yokomori
    On Purely Morphic Characterizations of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:301-308 [Journal]
  46. Takashi Yokomori
    Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:282-283 [Journal]

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002