Michio Oyamaguchi

According to our database, Michio Oyamaguchi authored at least 27 papers between 1978 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Confluence by Critical Pair Analysis Revisited (Extended Version).

Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi

CoRR, 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.

Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi

Proceedings of the Automated Deduction - CADE 27, 2019

2017

Critical Peaks Redefined - $Φ\sqcup Ψ= \top$.

Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi

CoRR, 2017

2015

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent.

Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa

Proceedings of the Automated Deduction - CADE-25, 2015

2010

The Unification Problem for Confluent Semi-Constructor TRSs.

Ichiro Mitsuhashi, Michio Oyamaguchi, Kunihiro Matsuura

IEICE Trans. Inf. Syst., 2010

2006

The reachability and related decision problems for monadic and semi-constructor TRSs.

Ichiro Mitsuhashi, Michio Oyamaguchi, Toshiyuki Yamada

Inf. Process. Lett., 2006

The Joinability and Related Decision Problems for Semi-constructor TRSs.

Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada

Inf. Media Technol., 2006

The Confluence Problem for Flat TRSs.

Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard

Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

2004

On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems.

Michio Oyamaguchi, Yoshikatsu Ohta

IEICE Trans. Inf. Syst., 2004

The Joinability and Unification Problems for Confluent Semi-constructor TRSs.

Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2003

The unification problem for confluent right-ground term rewriting systems.

Michio Oyamaguchi, Yoshikatsu Ohta

Inf. Comput., 2003

1997

A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems.

Michio Oyamaguchi, Yoshikatsu Ohta

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1994

Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems.

Yoshihito Toyama, Michio Oyamaguchi

Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

1993

NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems.

Michio Oyamaguchi

SIAM J. Comput., 1993

1987

The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable.

Michio Oyamaguchi

Theor. Comput. Sci., 1987

The equivalence problem for real-time DPDAs.

Michio Oyamaguchi

J. ACM, 1987

1985

On the Data Type Extension Problem for Algebraic Specifications.

Michio Oyamaguchi

Theor. Comput. Sci., 1985

1984

Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines.

Michio Oyamaguchi

Theor. Comput. Sci., 1984

Some Remarks on Subclass Containment Problems for Several Classes of DPDA's.

Michio Oyamaguchi

Inf. Process. Lett., 1984

1983

Relationship Between Abstract and Concrete Implementations of Algebraic Specifications.

Michio Oyamaguchi

Proceedings of the Information Processing 83, 1983

1981

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

1980

A Simplicity Test for Deterministic Pushdown Automata

Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda

Inf. Control., October, 1980

A Real-Time Strictness Test for Deterministic Pushdown Automata

Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda

Inf. Control., October, 1980

The Equivalence Problem for Real-Time Strict Deterministic Languages

Michio Oyamaguchi, Namio Honda

Inf. Control., April, 1980

On the Equivalence Problem for Two DPDA's, One of which is Real-Time.

Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1978

The Decidability of Equivalence for Determistic Stateless Pushdown Automata

Michio Oyamaguchi, Namio Honda

Inf. Control., September, 1978