Michio Oyamaguchi

28 papers A 2Misc 1Journal 19Unranked 6
YearRankTypeTitle / Venue / Authors
2019 J jnl
Conditions for confluence of innermost terminating term rewriting systems.
Appl. Algebra Eng. Commun. Comput.
Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai
2019 J jnl
Confluence by Critical Pair Analysis Revisited (Extended Version).
CoRR
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
2019 A conf
Confluence by Critical Pair Analysis Revisited.
CADE
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
2017 J jnl
Critical Peaks Redefined - $Φ\sqcup Ψ= \top$.
CoRR
Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi
2015 A conf
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent.
CADE
Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa
2010 J jnl
The Unification Problem for Confluent Semi-Constructor TRSs.
IEICE Trans. Inf. Syst.
Ichiro Mitsuhashi, Michio Oyamaguchi, Kunihiro Matsuura
2006 Misc conf
The Confluence Problem for Flat TRSs.
AISC
Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard
2006 J jnl
The Joinability and Related Decision Problems for Semi-constructor TRSs.
Inf. Media Technol.
Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada
2006 J jnl
The reachability and related decision problems for monadic and semi-constructor TRSs.
Inf. Process. Lett.
Ichiro Mitsuhashi, Michio Oyamaguchi, Toshiyuki Yamada
2004 J jnl
On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems.
IEICE Trans. Inf. Syst.
Michio Oyamaguchi, Yoshikatsu Ohta
2004 — conf
The Joinability and Unification Problems for Confluent Semi-constructor TRSs.
RTA
Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada
2003 J jnl
The unification problem for confluent right-ground term rewriting systems.
Inf. Comput.
Michio Oyamaguchi, Yoshikatsu Ohta
2001 — conf
The Unification Problem for Confluent Right-Ground Term Rewriting Systems.
RTA
Michio Oyamaguchi, Yoshikatsu Ohta
1997 — conf
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems.
RTA
Michio Oyamaguchi, Yoshikatsu Ohta
1994 — conf
Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems.
CTRS
Yoshihito Toyama, Michio Oyamaguchi
1993 J jnl
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems.
SIAM J. Comput.
Michio Oyamaguchi
1987 J jnl
The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable.
Theor. Comput. Sci.
Michio Oyamaguchi
1987 J jnl
The equivalence problem for real-time DPDAs.
J. ACM
Michio Oyamaguchi
1985 J jnl
On the Data Type Extension Problem for Algebraic Specifications.
Theor. Comput. Sci.
Michio Oyamaguchi
1984 J jnl
Some Remarks on Subclass Containment Problems for Several Classes of DPDA's.
Inf. Process. Lett.
Michio Oyamaguchi
1984 J jnl
Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines.
Theor. Comput. Sci.
Michio Oyamaguchi
1983 — conf
Relationship Between Abstract and Concrete Implementations of Algebraic Specifications.
IFIP Congress
Michio Oyamaguchi
1981 J jnl
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine.
J. Comput. Syst. Sci.
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
1980 J jnl
A Real-Time Strictness Test for Deterministic Pushdown Automata
Inf. Control.
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
1980 J jnl
A Simplicity Test for Deterministic Pushdown Automata
Inf. Control.
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
1980 — conf
On the Equivalence Problem for Two DPDA's, One of which is Real-Time.
IFIP Congress
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
1980 J jnl
The Equivalence Problem for Real-Time Strict Deterministic Languages
Inf. Control.
Michio Oyamaguchi, Namio Honda
1978 J jnl
The Decidability of Equivalence for Determistic Stateless Pushdown Automata
Inf. Control.
Michio Oyamaguchi, Namio Honda