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

Search the dblp DataBase

Title:
Author:
Michio Oyamaguchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard
    The Confluence Problem for Flat TRSs. [Citation Graph (0, 0)][DBLP]
    AISC, 2006, pp:68-81 [Conf]
  2. Yoshihito Toyama, Michio Oyamaguchi
    Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:316-331 [Conf]
  3. Michio Oyamaguchi
    Relationship Between Abstract and Concrete Implementations of Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:407-412 [Conf]
  4. Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
    On the Equivalence Problem for Two DPDA's, One of which is Real-Time. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1980, pp:53-58 [Conf]
  5. Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada
    The Joinability and Unification Problems for Confluent Semi-constructor TRSs. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:285-300 [Conf]
  6. Michio Oyamaguchi, Yoshikatsu Ohta
    The Unification Problem for Confluent Right-Ground Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:246-260 [Conf]
  7. Michio Oyamaguchi, Yoshikatsu Ohta
    A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:187-201 [Conf]
  8. Michio Oyamaguchi, Namio Honda
    The Decidability of Equivalence for Determistic Stateless Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:38, n:3, pp:367-376 [Journal]
  9. Michio Oyamaguchi, Namio Honda
    The Equivalence Problem for Real-Time Strict Deterministic Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:45, n:1, pp:90-115 [Journal]
  10. Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
    A Real-Time Strictness Test for Deterministic Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:47, n:1, pp:1-9 [Journal]
  11. Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
    A Simplicity Test for Deterministic Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1980, v:47, n:1, pp:10-36 [Journal]
  12. Michio Oyamaguchi, Yoshikatsu Ohta
    The unification problem for confluent right-ground term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:2, pp:187-211 [Journal]
  13. Michio Oyamaguchi
    Some Remarks on Subclass Containment Problems for Several Classes of DPDA's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:9-12 [Journal]
  14. Ichiro Mitsuhashi, Michio Oyamaguchi, Toshiyuki Yamada
    The reachability and related decision problems for monadic and semi-constructor TRSs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:6, pp:219-224 [Journal]
  15. Michio Oyamaguchi
    The equivalence problem for real-time DPDAs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:731-760 [Journal]
  16. Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
    The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:3, pp:366-382 [Journal]
  17. Michio Oyamaguchi
    NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:114-135 [Journal]
  18. Michio Oyamaguchi
    Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:317-335 [Journal]
  19. Michio Oyamaguchi
    On the Data Type Extension Problem for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:329-336 [Journal]
  20. Michio Oyamaguchi
    The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:49, n:, pp:43-79 [Journal]

Search in 0.002secs, Finished in 0.002secs
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