The Decidability of Equivalence for Determistic Stateless Pushdown Automata - Michio Oyamaguchi; Namio Honda (Inf. Control., 1978)

On the Equivalence Problem for Two DPDA's, One of which is Real-Time. - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (IFIP Congress, 1980)

The Equivalence Problem for Real-Time Strict Deterministic Languages - Michio Oyamaguchi; Namio Honda (Inf. Control., 1980)

A Real-Time Strictness Test for Deterministic Pushdown Automata - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (Inf. Control., 1980)

A Simplicity Test for Deterministic Pushdown Automata - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (Inf. Control., 1980)

The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. - Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda (J. Comput. Syst. Sci., 1981)

Relationship Between Abstract and Concrete Implementations of Algebraic Specifications. - Michio Oyamaguchi (IFIP Congress, 1983)

Some Remarks on Subclass Containment Problems for Several Classes of DPDA's. - Michio Oyamaguchi (Inf. Process. Lett., 1984)

Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines. - Michio Oyamaguchi (Theor. Comput. Sci., 1984)

On the Data Type Extension Problem for Algebraic Specifications. - Michio Oyamaguchi (Theor. Comput. Sci., 1985)

The equivalence problem for real-time DPDAs. - Michio Oyamaguchi (J. ACM, 1987)

The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable. - Michio Oyamaguchi (Theor. Comput. Sci., 1987)

NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems. - Michio Oyamaguchi (SIAM J. Comput., 1993)

Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems. - Yoshihito Toyama; Michio Oyamaguchi (CTRS, 1994)

A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems. - Michio Oyamaguchi; Yoshikatsu Ohta (RTA, 1997)

The unification problem for confluent right-ground term rewriting systems. - Michio Oyamaguchi; Yoshikatsu Ohta (Inf. Comput., 2003)

The Joinability and Unification Problems for Confluent Semi-constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Yoshikatsu Ohta; Toshiyuki Yamada (RTA, 2004)

On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems. - Michio Oyamaguchi; Yoshikatsu Ohta (IEICE Trans. Inf. Syst., 2004)

The Confluence Problem for Flat TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Florent Jacquemard (AISC, 2006)

The Joinability and Related Decision Problems for Semi-constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Yoshikatsu Ohta; Toshiyuki Yamada (Inf. Media Technol., 2006)

The reachability and related decision problems for monadic and semi-constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Toshiyuki Yamada (Inf. Process. Lett., 2006)

The Unification Problem for Confluent Semi-Constructor TRSs. - Ichiro Mitsuhashi; Michio Oyamaguchi; Kunihiro Matsuura (IEICE Trans. Inf. Syst., 2010)

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent. - Masahiko Sakai; Michio Oyamaguchi; Mizuhito Ogawa (CADE, 2015)

Critical Peaks Redefined - $Φ sqcup Ψ= top$. - Nao Hirokawa; Julian Nagele; Vincent van Oostrom; Michio Oyamaguchi (CoRR, 2017)

Confluence by Critical Pair Analysis Revisited. - Nao Hirokawa; Julian Nagele; Vincent van Oostrom; Michio Oyamaguchi (CADE, 2019)

Conditions for confluence of innermost terminating term rewriting systems. - Sayaka Ishizuki; Michio Oyamaguchi; Masahiko Sakai (Appl. Algebra Eng. Commun. Comput., 2019)

Confluence by Critical Pair Analysis Revisited (Extended Version). - Nao Hirokawa; Julian Nagele; Vincent van Oostrom; Michio Oyamaguchi (CoRR, 2019)