Michio Oyamaguchi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2019

Confluence by Critical Pair Analysis RevisitedNao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi. cade 2019: 319-336 [doi]

Conditions for confluence of innermost terminating term rewriting systemsSayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai. aaecc, 30(4):349-360, 2019. [doi]

2015

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are ConfluentMasahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa. cade 2015: 111-126 [doi]

2010

The Unification Problem for Confluent Semi-Constructor TRSsIchiro Mitsuhashi, Michio Oyamaguchi, Kunihiro Matsuura. ieicet, 93-D(11):2962-2978, 2010. [doi]

2006

2004

The Joinability and Unification Problems for Confluent Semi-constructor TRSsIchiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada. RTA 2004: 285-300 [doi]

On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting SystemsMichio Oyamaguchi, Yoshikatsu Ohta. ieicet, 87-D(2):290-298, 2004. [doi]

2003

The unification problem for confluent right-ground term rewriting systemsMichio Oyamaguchi, Yoshikatsu Ohta. iandc, 183(2):187-211, 2003. [doi]

2001

The Unification Problem for Confluent Right-Ground Term Rewriting SystemsMichio Oyamaguchi, Yoshikatsu Ohta. RTA 2001: 246-260 [doi]

1997

A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting SystemsMichio Oyamaguchi, Yoshikatsu Ohta. RTA 1997: 187-201

1994

Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting SystemsYoshihito Toyama, Michio Oyamaguchi. ctrs 1995: 316-331

1993

NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting SystemsMichio Oyamaguchi. SICOMP, 22(1):114-135, 1993.

1987

The Church-Rosser Property for Ground Term-Rewriting Systems is DecidableMichio Oyamaguchi. TCS, 49:43-79, 1987.

The equivalence problem for real-time DPDAsMichio Oyamaguchi. JACM, 34(3):731-760, 1987. [doi]

1985

On the Data Type Extension Problem for Algebraic SpecificationsMichio Oyamaguchi. TCS, 35:329-336, 1985.

1984

Some Remarks on Subclass Containment Problems for Several Classes of DPDA sMichio Oyamaguchi. ipl, 19(1):9-12, 1984.

Some Results on Subclass Containment Problems for Special Classes of DPDA s Related to Nonsingular MachinesMichio Oyamaguchi. TCS, 31:317-335, 1984.

1983

Relationship Between Abstract and Concrete Implementations of Algebraic SpecificationsMichio Oyamaguchi. ifip 1983: 407-412

1981

The Equivalence Problem for Two DPDA s, One of Which is a Finite-Turn or One-Counter MachineMichio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda. jcss, 23(3):366-382, 1981.

1980

On the Equivalence Problem for Two DPDA s, One of which is Real-TimeMichio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda. ifip 1980: 53-58

The Equivalence Problem for Real-Time Strict Deterministic LanguagesMichio Oyamaguchi, Namio Honda. iandc, 45(1):90-115, April 1980.

A Real-Time Strictness Test for Deterministic Pushdown AutomataMichio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda. iandc, 47(1):1-9, October 1980.

A Simplicity Test for Deterministic Pushdown AutomataMichio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda. iandc, 47(1):10-36, October 1980.

1978

The Decidability of Equivalence for Determistic Stateless Pushdown AutomataMichio Oyamaguchi, Namio Honda. iandc, 38(3):367-376, September 1978.

Sign in or sign up to see more results.

runs on WebDSL