#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1990

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yoshihiro Mizoguchi, Yasuo Kawahara
- Theor. Comput. Sci.
- 1995

This note presents a new formalization of graph rewritings which generalizes traditional graph rewritings. Relational notions of graphs and their rewritings are introduced and several properties about graph rewritings are discussed using relational calculus (theory of binary relations). Single pushout approaches to graph rewritings proposed by Raoult and… (More)

- Hitoshi Furusawa, Yasuo Kawahara, +9 authors Noriko Sugimoto
- 1998

The aim of this thesis is to develop the fuzzy relational calculus. To develop this calculus, we study four algebraic formalisations of fuzzy relations which are called fuzzy relation algebras, Zadeh categories, relation algebras and Dedekind categories, and we strive to arrive at their representation theorems. The calculus of relations has been… (More)

- Shuichi Inokuchi, Yoshihiro Mizoguchi
- IJUC
- 2005

In this paper, in order to investigate natural transformations from discrete CA to QCA, we introduce a formulation of finite cyclic QCA and generalized notion of partitioned QCA. According to the formulations, we demonstratethe condition of local transition functions, which induce a global transition of well-formed QCA. Following the results, extending a… (More)

- Takeru Akazawa, S Muhesen, Yukio Dodo, O Kondo, Yoshihiro Mizoguchi
- Nature
- 1995

- Yasuo Kawahara, Yoshihiro Mizoguchi
- Dagstuhl Seminar on Graph Transformations in…
- 1993

Discrete quantum cellular automata are cellular automata with reversible transition. This paper deals with 1d cellular automata with finite cell array and triplet local transition rules. We present the necessary condition of local transition rules for cellular automata to be reversible, and prove the reversibility of some cellular automata.

We introduce the notion of 'Composition', 'Union' and 'Division' of cellular automata on groups. A kind of notions of compositions was investigated by Sato (1994) and Manzini (1998) for linear cellular automata, we extend the notion to general cellular automata on groups and investigated their properties. We observe the all unions and compositions generated… (More)

- Shizuo Kaji, Sampei Hirose, Shigehiro Sakata, Yoshihiro Mizoguchi, Ken-ichi Anjyo
- Symposium on Computer Animation
- 2012

This paper gives a simple mathematical framework for 2D shape interpolation methods that preserve rigidity. An interpolation technique in this framework works for given the source and target 2D shapes, which are compatibly triangulated. Focusing on the local affine maps between the corresponding triangles, we describe a global transformation as a piecewise… (More)

- Jota Ishikawa, Hiroshi Mukunoki, +7 authors Dan Sasaki
- 2005

Free trade agreements (FTAs) have rules of origin (ROOs) to prevent tariff circumvention by firms of non-member countries. This paper points out that in imperfectly competitive markets, ROOs have another role overlooked in the existing literature. Instead of focusing on the impacts of ROOs in the intermediate-good markets, we draw our attention to the… (More)

In 1984, Raoult proposed a formalization of graph rewritings using pushouts in the category of graphs and partial functions. This note generalizes his method and formulates algebraic graph structure to introduce a more general framework for graph rewritings and to give a simple proof of existence theorem of pushouts using relational calculus.