×

zbMATH — the first resource for mathematics

Ogawa, Mizuhito

Compute Distance To:
Author ID: ogawa.mizuhito Recent zbMATH articles by "Ogawa, Mizuhito"
Published as: Ogawa, M.; Ogawa, Mizuhito
Documents Indexed: 33 Publications since 1992, including 1 Book

Publications by Year

Citations contained in zbMATH

22 Publications have been cited 44 times in 32 Documents Cited by Year
Event-clock visibly pushdown automata. Zbl 1206.68183
Van Tang, Nguyen; Ogawa, Mizuhito
5
2009
Nested timed automata. Zbl 1390.68407
Li, Guoqiang; Cai, Xiaojuan; Ogawa, Mizuhito; Yuen, Shoji
4
2013
raSAT: an SMT solver for polynomial constraints. Zbl 1377.68140
Tung, Vu Xuan; Khanh, To Van; Ogawa, Mizuhito
3
2017
raSAT: an SMT solver for polynomial constraints. Zbl 06623264
Tung, Vu Xuan; Van Khanh, To; Ogawa, Mizuhito
3
2016
Well-structured pushdown systems. Zbl 1390.68461
Cai, Xiaojuan; Ogawa, Mizuhito
3
2013
Perpetuality and uniform normalization. Zbl 0884.03010
Khasidashvili, Zurab; Ogawa, Mizuhito
3
1997
Unique normal form property of higher-order rewriting systems. Zbl 1355.68141
Mano, Ken; Ogawa, Mizuhito
3
1996
Well-structured pushdown system: case of dense timed pushdown automata. Zbl 1417.68080
Cai, Xiaojuan; Ogawa, Mizuhito
2
2014
Perpetuality and uniform normalization in orthogonal rewrite systems. Zbl 1003.68057
Khasidashvili, Zurab; Ogawa, Mizuhito; van Oostrom, Vincent
2
2001
Uniform normalisation beyond orthogonality. Zbl 0981.68071
Khasidashvili, Zurab; Ogawa, Mizuhito; van Oostrom, Vincent
2
2001
Unique normal form property of compatible term rewriting systems: A new proof of Chew’s theorem. Zbl 0974.68080
Mano, K.; Ogawa, M.
2
2001
Chew’s theorem revisited: Uniquely normalizing property of nonlinear term rewriting systems. Zbl 0925.03096
Ogawa, Mizuhito
2
1992
Subtropical satisfiability. Zbl 1425.68374
Fontaine, Pascal; Ogawa, Mizuhito; Sturm, Thomas; Vu, Xuan Tung
1
2017
Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent. Zbl 06515501
Sakai, Masahiko; Oyamaguchi, Michio; Ogawa, Mizuhito
1
2015
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. Zbl 1234.68185
Sakai, Masahiko; Ogawa, Mizuhito
1
2010
Authentication revisited: Flaw or not, the recursive authentication protocol. Zbl 1183.94053
Li, Guoqiang; Ogawa, Mizuhito
1
2008
On-the-fly model checking of fair non-repudiation protocols. Zbl 1141.68475
Li, Guoqiang; Ogawa, Mizuhito
1
2007
Maximum marking problems with accumulative weight functions. Zbl 1169.68368
Sasano, Isao; Ogawa, Mizuhito; Hu, Zhenjiang
1
2005
Well-quasi-orders and regular \(\omega\)-languages. Zbl 1105.68065
Ogawa, Mizuhito
1
2004
Generation of a linear time query processing algorithm based on well-quasi-orders. Zbl 1087.68561
Ogawa, Mizuhito
1
2001
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. Zbl 1321.68229
Sasano, Isao; Hu, Zhenjiang; Takeichi, Masato; Ogawa, Mizuhito
1
2000
A new proof of Chew’s theorem. Zbl 0939.68673
Mano, Ken; Ogawa, Mizuhito
1
1995
raSAT: an SMT solver for polynomial constraints. Zbl 1377.68140
Tung, Vu Xuan; Khanh, To Van; Ogawa, Mizuhito
3
2017
Subtropical satisfiability. Zbl 1425.68374
Fontaine, Pascal; Ogawa, Mizuhito; Sturm, Thomas; Vu, Xuan Tung
1
2017
raSAT: an SMT solver for polynomial constraints. Zbl 06623264
Tung, Vu Xuan; Van Khanh, To; Ogawa, Mizuhito
3
2016
Non-\(E\)-overlapping, weakly shallow, and non-collapsing TRSs are confluent. Zbl 06515501
Sakai, Masahiko; Oyamaguchi, Michio; Ogawa, Mizuhito
1
2015
Well-structured pushdown system: case of dense timed pushdown automata. Zbl 1417.68080
Cai, Xiaojuan; Ogawa, Mizuhito
2
2014
Nested timed automata. Zbl 1390.68407
Li, Guoqiang; Cai, Xiaojuan; Ogawa, Mizuhito; Yuen, Shoji
4
2013
Well-structured pushdown systems. Zbl 1390.68461
Cai, Xiaojuan; Ogawa, Mizuhito
3
2013
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. Zbl 1234.68185
Sakai, Masahiko; Ogawa, Mizuhito
1
2010
Event-clock visibly pushdown automata. Zbl 1206.68183
Van Tang, Nguyen; Ogawa, Mizuhito
5
2009
Authentication revisited: Flaw or not, the recursive authentication protocol. Zbl 1183.94053
Li, Guoqiang; Ogawa, Mizuhito
1
2008
On-the-fly model checking of fair non-repudiation protocols. Zbl 1141.68475
Li, Guoqiang; Ogawa, Mizuhito
1
2007
Maximum marking problems with accumulative weight functions. Zbl 1169.68368
Sasano, Isao; Ogawa, Mizuhito; Hu, Zhenjiang
1
2005
Well-quasi-orders and regular \(\omega\)-languages. Zbl 1105.68065
Ogawa, Mizuhito
1
2004
Perpetuality and uniform normalization in orthogonal rewrite systems. Zbl 1003.68057
Khasidashvili, Zurab; Ogawa, Mizuhito; van Oostrom, Vincent
2
2001
Uniform normalisation beyond orthogonality. Zbl 0981.68071
Khasidashvili, Zurab; Ogawa, Mizuhito; van Oostrom, Vincent
2
2001
Unique normal form property of compatible term rewriting systems: A new proof of Chew’s theorem. Zbl 0974.68080
Mano, K.; Ogawa, M.
2
2001
Generation of a linear time query processing algorithm based on well-quasi-orders. Zbl 1087.68561
Ogawa, Mizuhito
1
2001
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. Zbl 1321.68229
Sasano, Isao; Hu, Zhenjiang; Takeichi, Masato; Ogawa, Mizuhito
1
2000
Perpetuality and uniform normalization. Zbl 0884.03010
Khasidashvili, Zurab; Ogawa, Mizuhito
3
1997
Unique normal form property of higher-order rewriting systems. Zbl 1355.68141
Mano, Ken; Ogawa, Mizuhito
3
1996
A new proof of Chew’s theorem. Zbl 0939.68673
Mano, Ken; Ogawa, Mizuhito
1
1995
Chew’s theorem revisited: Uniquely normalizing property of nonlinear term rewriting systems. Zbl 0925.03096
Ogawa, Mizuhito
2
1992

Citations by Year