Multiscale Graph Grammars Can Generate Cayley Graphs of Groups and Monoids

ABSTRACT: A graph grammar with parallel replacement of subgraphs, based on the single-pushout approach in graph rewriting, was designed which constructs Cayley graphs of monoids of transformations of a finite set, with permutation groups as a special case. As input, graph-based representations of a finite number of generating transformations have to be specified; they will then correspond to the edge types of the Cayley graph which is the final result of the rewriting process. The grammar has

SUBMITTER: Gadducci F 

PROVIDER: S-EPMC7314706 | biostudies-literature | 2020 May

REPOSITORIES: biostudies-literature