×
Author ID: oyamaguchi.michio Recent zbMATH articles by "Oyamaguchi, Michio"
Published as: Oyamaguchi, Michio; Oyamaguch, Michio
Documents Indexed: 27 Publications since 1978
Co-Authors: 15 Co-Authors with 20 Joint Publications
134 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

22 Publications have been cited 139 times in 96 Documents Cited by Year
The equivalence problem for real-time strict deterministic languages. Zbl 0444.68038
Oyamaguchi, Michio; Honda, Namio; Inagaki, Yasuyoshi
29
1980
The Church-Rosser property for ground term-rewriting systems is decidable. Zbl 0641.68044
Oyamaguchi, Michio
18
1987
The decidability of equivalence for deterministic stateless pushdown automata. Zbl 0393.68078
Oyamaguchi, Michio; Honda, Namio
18
1978
The equivalence problem for real-time DPDAs. Zbl 0637.68094
Oyamaguchi, Michio
11
1987
NV-sequentiality: A decidable condition for call-by-need computations in term-rewriting systems. Zbl 0766.68069
Oyamaguchi, Michio
10
1993
The confluence problem for flat TRSs. Zbl 1156.68433
Mitsuhashi, Ichiro; Oyamaguch, Michio; Jacquemard, Florent
10
2006
The equivalence problem for two dpda’s, one of which is a finite-turn or one-counter machine. Zbl 0473.68046
Oyamaguchi, Michio; Inagaki, Yasuyoshi; Honda, Namio
7
1981
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems. Zbl 1379.68202
Oyamaguchi, Michio; Ohta, Yoshikatsu
7
1997
Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. Zbl 0939.68668
Toyama, Yoshihito; Oyamaguchi, Michio
6
1993
The joinability and unification problems for confluent semi-constructor TRSs. Zbl 1187.68281
Mitsuhashi, Ichiro; Oyamaguchi, Michio; Ohta, Yoshikatsu; Yamada, Toshiyuki
4
2004
A real-time strictness test for deterministic pushdown automata. Zbl 0488.68050
Oyamaguchi, Michio; Inagaki, Yasuyoshi; Honda, Namio
3
1980
Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. Zbl 0939.68686
Toyama, Yoshihito; Oyamaguchi, Michio
3
1995
The reachability problem for quasi-ground term rewriting systems. Zbl 0639.68030
Oyamaguchi, Michio
2
1986
The reachability and related decision problems for monadic and semi-constructor TRSs. Zbl 1343.68127
Mitsuhashi, Ichiro; Oyamaguchi, Michio; Yamada, Toshiyuki
2
2006
Confluence by critical pair analysis revisited. Zbl 07178984
Hirokawa, Nao; Nagele, Julian; van Oostrom, Vincent; Oyamaguchi, Michio
2
2019
Some remarks on subclass containment problems for several classes of dpda’s. Zbl 0548.68078
Oyamaguchi, Michio
1
1984
On the data type extension problem for algebraic specifications. Zbl 0552.68013
Oyamaguchi, Michio
1
1985
On the Church-Rosser property of non-\(E\)-overlapping and weight-preserving TRS’s. Zbl 0925.68271
Gomi, Hiroshi; Oyamaguchi, Michio; Ohta, Yoshikatsu
1
1996
Some results on subclass containment problems for special classes of dpda’s related to nonsingular machines. Zbl 0568.68067
Oyamaguchi, Michio
1
1984
A simplicity test for deterministic pushdown automata. Zbl 0458.68029
Oyamaguchi, Michio; Inagaki, Yasuyoshi
1
1980
Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent. Zbl 1465.68125
Sakai, Masahiko; Oyamaguchi, Michio; Ogawa, Mizuhito
1
2015
The unification problem for confluent right-ground term rewriting systems. Zbl 1054.68081
Oyamaguchi, Michio; Ohta, Yoshikatsu
1
2003
Confluence by critical pair analysis revisited. Zbl 07178984
Hirokawa, Nao; Nagele, Julian; van Oostrom, Vincent; Oyamaguchi, Michio
2
2019
Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent. Zbl 1465.68125
Sakai, Masahiko; Oyamaguchi, Michio; Ogawa, Mizuhito
1
2015
The confluence problem for flat TRSs. Zbl 1156.68433
Mitsuhashi, Ichiro; Oyamaguch, Michio; Jacquemard, Florent
10
2006
The reachability and related decision problems for monadic and semi-constructor TRSs. Zbl 1343.68127
Mitsuhashi, Ichiro; Oyamaguchi, Michio; Yamada, Toshiyuki
2
2006
The joinability and unification problems for confluent semi-constructor TRSs. Zbl 1187.68281
Mitsuhashi, Ichiro; Oyamaguchi, Michio; Ohta, Yoshikatsu; Yamada, Toshiyuki
4
2004
The unification problem for confluent right-ground term rewriting systems. Zbl 1054.68081
Oyamaguchi, Michio; Ohta, Yoshikatsu
1
2003
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems. Zbl 1379.68202
Oyamaguchi, Michio; Ohta, Yoshikatsu
7
1997
On the Church-Rosser property of non-\(E\)-overlapping and weight-preserving TRS’s. Zbl 0925.68271
Gomi, Hiroshi; Oyamaguchi, Michio; Ohta, Yoshikatsu
1
1996
Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. Zbl 0939.68686
Toyama, Yoshihito; Oyamaguchi, Michio
3
1995
NV-sequentiality: A decidable condition for call-by-need computations in term-rewriting systems. Zbl 0766.68069
Oyamaguchi, Michio
10
1993
Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. Zbl 0939.68668
Toyama, Yoshihito; Oyamaguchi, Michio
6
1993
The Church-Rosser property for ground term-rewriting systems is decidable. Zbl 0641.68044
Oyamaguchi, Michio
18
1987
The equivalence problem for real-time DPDAs. Zbl 0637.68094
Oyamaguchi, Michio
11
1987
The reachability problem for quasi-ground term rewriting systems. Zbl 0639.68030
Oyamaguchi, Michio
2
1986
On the data type extension problem for algebraic specifications. Zbl 0552.68013
Oyamaguchi, Michio
1
1985
Some remarks on subclass containment problems for several classes of dpda’s. Zbl 0548.68078
Oyamaguchi, Michio
1
1984
Some results on subclass containment problems for special classes of dpda’s related to nonsingular machines. Zbl 0568.68067
Oyamaguchi, Michio
1
1984
The equivalence problem for two dpda’s, one of which is a finite-turn or one-counter machine. Zbl 0473.68046
Oyamaguchi, Michio; Inagaki, Yasuyoshi; Honda, Namio
7
1981
The equivalence problem for real-time strict deterministic languages. Zbl 0444.68038
Oyamaguchi, Michio; Honda, Namio; Inagaki, Yasuyoshi
29
1980
A real-time strictness test for deterministic pushdown automata. Zbl 0488.68050
Oyamaguchi, Michio; Inagaki, Yasuyoshi; Honda, Namio
3
1980
A simplicity test for deterministic pushdown automata. Zbl 0458.68029
Oyamaguchi, Michio; Inagaki, Yasuyoshi
1
1980
The decidability of equivalence for deterministic stateless pushdown automata. Zbl 0393.68078
Oyamaguchi, Michio; Honda, Namio
18
1978
all top 5

Cited by 81 Authors

8 Courcelle, Bruno
8 Sénizergues, Géraud
7 Oyamaguchi, Michio
6 Middeldorp, Aart
6 Sakai, Masahiko
5 Vágvölgyi, Sándor
4 Godoy, Guillem
4 Jacquemard, Florent
4 Klop, Jan Willem
4 Tomita, Etsuji
4 Verma, Rakesh M.
3 Dershowitz, Nachum
3 Jouannaud, Jean-Pierre
3 Lucas, Salvador
3 Stirling, Colin
3 Yehudai, Amiram
2 Culik, Karel II
2 Durand, Irène A.
2 Gallier, Jean H.
2 Hirokawa, Nao
2 Ibarra, Oscar H.
2 Ogawa, Mizuhito
2 Seino, Kazushi
2 Tison, Sophie
2 Toyama, Yoshihito
1 Antoy, Sergio
1 Aoto, Takahito
1 Boasson, Luc
1 Bogaert, Bruno
1 Caron, Anne-Cécile
1 Comon, Hubert
1 Coquidé, Jean-Luc
1 Czajka, Łukasz
1 Dauchet, Max
1 de Vrijer, R. C.
1 Endrullis, Jörg
1 Engelfriet, Joost
1 Felgenhauer, Bertram
1 Friedman, Emily P.
1 Fülöp, Zoltán
1 Gascón, Adrià
1 Gramlich, Bernhard
1 Greibach, Sheila A.
1 Hernández, Hugo
1 Heuillard, Thierry
1 Honda, Namio
1 Ida, Tetsuo
1 Inagaki, Yasuyoshi
1 Ishizuki, Sayaka
1 Itzhaik, Yair
1 Karhumaki, Juhani
1 Khasidashvili, Zurab O.
1 Kojima, Yoshiharu
1 Lescanne, Pierre
1 Lisovik, Leonid P.
1 Meitus, V. Yu.
1 Mejtus, V. Yu.
1 Mitsuhashi, Ichiro
1 Moraes, Luis F. T.
1 Nagaya, Takashi
1 Nijholt, Anton
1 Overbeek, Roy
1 Pitti, Jan
1 Pittl, Jan
1 Radcliffe, Nicholas R.
1 Romanovskij, V. Yu.
1 Rosier, Louis E.
1 Sakabe, Toshiki
1 Salomaa, Kai T.
1 Shintani, Kiraku
1 Simonsen, Jakob Grue
1 Snyder, Wayne
1 Suzuki, Taro
1 Tiwari, Ashish Kumar
1 Uchiyama, Keita
1 Wang, Yi
1 Wirth, Claus-Peter
1 Yamada, Toshiyuki
1 Yoshida, Junichi
1 Zakharov, Vladimir Anatolyevich
1 Zankl, Harald

Citations by Year