Abstract | ||
---|---|---|
In this paper, the computational power of several control mechanisms for specific variants of (sequential, isometric) array grammars generating arrays on Cayley grids of finitely presented groups is investigated. Using #-context-free array productions together with control mechanisms as control graphs, matrices, permitting and forbidden rules, partial order on rules or activation and blocking of rules the same computational power is obtained as when using arbitrary array productions. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1007/978-3-319-92402-1_1 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Rule-based machine translation,Discrete mathematics,Graph,Combinatorics,Matrix (mathematics),Computer science | Conference | 10881 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
13 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rudolf Freund | 1 | 12 | 2.39 |