Yoshihiro Mizoguchi | Kyushu University (original) (raw)
Uploads
Papers by Yoshihiro Mizoguchi
RIFIS Technical Report, Jul 1, 1991
Japan Journal of Medical Informatics, 2001
Lecture Notes in Computer Science, 2006
Journal of Computer Chemistry, Japan, 2021
IEICE Transactions on Information and Systems, 2014
We consider a graph with labels of edges. A label means the length of an edge. We present a metho... more We consider a graph with labels of edges. A label means the length of an edge. We present a method to compute the length of the shortest path between two ver-tices using graph transformations. We introduce graph transformation rules which preserve the length of paths. Reducing to a simple graph which contains two ver-tices, we finally calculate the length of the shortest path of those two vertices. There were several algorithms for computing network reliabilities using graph transfor-mations. We use the same framework as those algorithms for applying the graph transformation rules, but our transformation rules do not calculate the network reliabilities but calculate the length of the shortest path. 1.
collision systems simulated by cellular automata
orkshop 2014 ~Discrete M athem atics and its Applications~
This note presents a new formalization of graph rewritings which generalizes traditional graph re... more 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 Kennaway are compared with our rewritings of relational (labeled) graph. Moreover a more general sufficient condition for two rewritings to commute and a theorem concerning critical pairs useful to demonstrate the confluency of graph rewriting systems are also given. 1 Introduction There are many researches [1-7,9,13,14,16-18,20-22] on graph grammars and graph rewritings which have a lot of applications including software specification, data bases, analysis of concurrent systems, developmental biology and many others. In these one of the advantages of categorical graph rewritings is to produce a universal reduction which eases theor...
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantu... more Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d reversible cellular automata with triplet local rules. 1
Energy has been studied in mathematical perspective as well as physical perspective for several y... more Energy has been studied in mathematical perspective as well as physical perspective for several years ago. In spectral graph theory, the eigenvalues of several kinds of matrices have been studied, of which Laplacian matrix attracted the greatest attention
Int. J. Unconv. Comput., 2005
J. Watrous introduced the notion of quantum cellular automata(QCA) and showed that any quantum Tu... more J. Watrous introduced the notion of quantum cellular automata(QCA) and showed that any quantum Turing machine can be efficiently simulated by a QCA with constant slowdown in 1995. CA with quantum cells is well-formed QCA if and only if its global transition function is unitary. Generally quantumization of cells of a classical CA dose not make it become QCA, because usually classical CA dose not have reversibility. Morita and Harao show that we can get reversible CA by partition a cell into three part and partitioned CA(PCA) can simulate non-partitioned CA(NPCA)[10]. But there is not a trivial inclusion relation between PCA and NPCA. In this paper, we introduce a new formulation of finite cyclic QCA and generalized notion of partitioned QCA in order to investigate natural transformations from discrete CA to QCA. According to the formulations, we demonstrate a condition of a local transition function, which induce a well-formed QCA. A natural correspondence of classical cells and quan...
MI Preprint Series, 2008
We describe an algebraic transition system called an abstract collision system. An abstract colli... more We describe an algebraic transition system called an abstract collision system. An abstract collision system is an extension of a billiard ball system. Moreover, it is also an extension of a cellular automaton, a chemical reaction system and so on. We introduced an abstract collision system and investigated its properties [4]. In this paper, we study about simulation of abstract collision systems by cellular automata. It is impossible to simulate some abstract collision system. However, some of them can be easily simulated by a cellular automaton. First, we describe definitions of components of an abstract collision system. Next, we introduce how to construct a cellular automaton which simulates an abstract collision system. Finally, we investigate properties and conditions about simulations.
RIFIS Technical Report, Jul 1, 1991
Japan Journal of Medical Informatics, 2001
Lecture Notes in Computer Science, 2006
Journal of Computer Chemistry, Japan, 2021
IEICE Transactions on Information and Systems, 2014
We consider a graph with labels of edges. A label means the length of an edge. We present a metho... more We consider a graph with labels of edges. A label means the length of an edge. We present a method to compute the length of the shortest path between two ver-tices using graph transformations. We introduce graph transformation rules which preserve the length of paths. Reducing to a simple graph which contains two ver-tices, we finally calculate the length of the shortest path of those two vertices. There were several algorithms for computing network reliabilities using graph transfor-mations. We use the same framework as those algorithms for applying the graph transformation rules, but our transformation rules do not calculate the network reliabilities but calculate the length of the shortest path. 1.
collision systems simulated by cellular automata
orkshop 2014 ~Discrete M athem atics and its Applications~
This note presents a new formalization of graph rewritings which generalizes traditional graph re... more 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 Kennaway are compared with our rewritings of relational (labeled) graph. Moreover a more general sufficient condition for two rewritings to commute and a theorem concerning critical pairs useful to demonstrate the confluency of graph rewriting systems are also given. 1 Introduction There are many researches [1-7,9,13,14,16-18,20-22] on graph grammars and graph rewritings which have a lot of applications including software specification, data bases, analysis of concurrent systems, developmental biology and many others. In these one of the advantages of categorical graph rewritings is to produce a universal reduction which eases theor...
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantu... more Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d reversible cellular automata with triplet local rules. 1
Energy has been studied in mathematical perspective as well as physical perspective for several y... more Energy has been studied in mathematical perspective as well as physical perspective for several years ago. In spectral graph theory, the eigenvalues of several kinds of matrices have been studied, of which Laplacian matrix attracted the greatest attention
Int. J. Unconv. Comput., 2005
J. Watrous introduced the notion of quantum cellular automata(QCA) and showed that any quantum Tu... more J. Watrous introduced the notion of quantum cellular automata(QCA) and showed that any quantum Turing machine can be efficiently simulated by a QCA with constant slowdown in 1995. CA with quantum cells is well-formed QCA if and only if its global transition function is unitary. Generally quantumization of cells of a classical CA dose not make it become QCA, because usually classical CA dose not have reversibility. Morita and Harao show that we can get reversible CA by partition a cell into three part and partitioned CA(PCA) can simulate non-partitioned CA(NPCA)[10]. But there is not a trivial inclusion relation between PCA and NPCA. In this paper, we introduce a new formulation of finite cyclic QCA and generalized notion of partitioned QCA in order to investigate natural transformations from discrete CA to QCA. According to the formulations, we demonstrate a condition of a local transition function, which induce a well-formed QCA. A natural correspondence of classical cells and quan...
MI Preprint Series, 2008
We describe an algebraic transition system called an abstract collision system. An abstract colli... more We describe an algebraic transition system called an abstract collision system. An abstract collision system is an extension of a billiard ball system. Moreover, it is also an extension of a cellular automaton, a chemical reaction system and so on. We introduced an abstract collision system and investigated its properties [4]. In this paper, we study about simulation of abstract collision systems by cellular automata. It is impossible to simulate some abstract collision system. However, some of them can be easily simulated by a cellular automaton. First, we describe definitions of components of an abstract collision system. Next, we introduce how to construct a cellular automaton which simulates an abstract collision system. Finally, we investigate properties and conditions about simulations.