The UA Campus Repository is experiencing systematic automated, high-volume traffic (bots). Temporary mitigation measures to address bot traffic have been put in place; however, this has resulted in restrictions on searching WITHIN collections or using sidebar filters WITHIN collections. You can still Browse by Title/Author/Year WITHIN collections. Also, you can still search at the top level of the repository (use the search box at the top of every page) and apply filters from that search level. Export of search results has also been restricted at this time. Please contact us at any time for assistance - email repository@u.library.arizona.edu.
Matrix Graph Grammars
| dc.contributor.author | Perez Velasco, Pedro Pablo | |
| dc.date.accessioned | 2008-01-07T00:00:01Z | |
| dc.date.available | 2010-06-18T23:33:24Z | |
| dc.date.issued | 2008-01 | en_US |
| dc.date.submitted | 2008-01-07 | en_US |
| dc.identifier.citation | Matrix Graph Grammars 2008-01, | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/105736 | |
| dc.description.abstract | If the aim of this dissertation had to be summarized in a single sentence, it could be algebraization of graph grammars. An equivalent one would be study of graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essence is a set of strings). On a more discrete mathematical style, it can be said that graph grammars â Matrix Graph Grammars in particular â study dynamics of graphs. Ideally, this algebraization would enforce our understanding of grammars in general, providing new analysis techniques and generalizations of concepts, problems and results known so far. In this dissertation we fully develop such theory over the field GF(2) which covers all graph cases, from simple graphs (more attractive for a mathematician) to multidigraphs (more interesting for an applied computer scientist). The theory is presented and its basic properties demonstrated in a first stage, moving to increasingly difficult problems and establishing relations among them. | |
| dc.format.mimetype | application/pdf | en_US |
| dc.language.iso | en | en_US |
| dc.subject | graph dynamics | en_US |
| dc.subject | graph grammars | en_US |
| dc.subject | Computer Science | en_US |
| dc.title | Matrix Graph Grammars | en_US |
| dc.type | Thesis | en_US |
| refterms.dateFOA | 2018-08-19T19:48:51Z | |
| html.description.abstract | If the aim of this dissertation had to be summarized in a single sentence, it could be algebraization of graph grammars. An equivalent one would be study of graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essence is a set of strings). On a more discrete mathematical style, it can be said that graph grammars â Matrix Graph Grammars in particular â study dynamics of graphs. Ideally, this algebraization would enforce our understanding of grammars in general, providing new analysis techniques and generalizations of concepts, problems and results known so far. In this dissertation we fully develop such theory over the field GF(2) which covers all graph cases, from simple graphs (more attractive for a mathematician) to multidigraphs (more interesting for an applied computer scientist). The theory is presented and its basic properties demonstrated in a first stage, moving to increasingly difficult problems and establishing relations among them. |
