dblp.uni-trier.dewww.uni-trier.de

Michio Oyamaguchi

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Namio Honda [1] [2] [3] [4] [5] [6]
2Yasuyoshi Inagaki [2] [3] [5] [6]
3Florent Jacquemard [20]
4Ichiro Mitsuhashi [18] [19] [20]
5Yoshikatsu Ohta [15] [16] [17] [18]
6Yoshihito Toyama [14]
7Toshiyuki Yamada [18] [19]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)