We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Graph rewriting
Jump to navigation
Jump to search
Graph rewriting is a computational process in which graphs are rewritten. The data structure is a (usually labeled) graph of vertices with edges between them. This is frequently used as an implementation or formal semantics of languages, especially functional ones. Undirected graph rewriting is addressed in Eodermdrome.
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.