en.unionpedia.org

Attributed graph grammar, the Glossary

Index Attributed graph grammar

In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes.[1]

Table of Contents

  1. 5 relations: Computer science, Double pushout graph rewriting, Graph rewriting, Single pushout graph rewriting, Technische Universität Berlin.

  2. Graph rewriting

Computer science

Computer science is the study of computation, information, and automation.

See Attributed graph grammar and Computer science

Double pushout graph rewriting

In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. Attributed graph grammar and double pushout graph rewriting are graph rewriting.

See Attributed graph grammar and Double pushout graph rewriting

Graph rewriting

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically.

See Attributed graph grammar and Graph rewriting

Single pushout graph rewriting

In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast to the double-pushout approach of graph rewriting. Attributed graph grammar and single pushout graph rewriting are graph rewriting and graph theory stubs.

See Attributed graph grammar and Single pushout graph rewriting

Technische Universität Berlin

italic (TU Berlin; also known as Berlin Institute of Technology and Technical University of Berlin, although officially the name should not be translated) is a public research university located in Berlin, Germany.

See Attributed graph grammar and Technische Universität Berlin

See also

Graph rewriting

References

[1] https://en.wikipedia.org/wiki/Attributed_graph_grammar

Also known as AGG (programming language), Attribute graph grammar, Attributed graph.