<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Graph theory / Formal languages / Logic in computer science / Graph rewriting / Mathematical logic / Rewriting / Graph / KnuthBendix completion algorithm / Abstract semantic graph / Tree
Date: 2016-12-11 09:11:57
Theoretical computer science
Mathematics
Graph theory
Formal languages
Logic in computer science
Graph rewriting
Mathematical logic
Rewriting
Graph
KnuthBendix completion algorithm
Abstract semantic graph
Tree

From Trees To Graphs: Understanding The Implications Of Sharing For Rewriting Student. Maria A Schett University of Innsbruck Technikerstrasse 21a

Add to Reading List

Source URL: www.maria-a-schett.net

Download Document from Source Website

File Size: 128,02 KB

Share Document on Facebook

Similar Documents

Meta-Predicates for Rodin Sebastian Krings Institut fur ¨ Informatik ¨ Dusseldorf Heinrich-Heine-Universitat

Meta-Predicates for Rodin Sebastian Krings Institut fur ¨ Informatik ¨ Dusseldorf Heinrich-Heine-Universitat

DocID: 1r6UG - View Document

Microsoft PowerPoint - ch07_9 [Compatibility Mode]

Microsoft PowerPoint - ch07_9 [Compatibility Mode]

DocID: 1qTUq - View Document

A non-desarguesian projective plane K.Tent and B.Zilber October 2, 2012 1

A non-desarguesian projective plane K.Tent and B.Zilber October 2, 2012 1

DocID: 1ql41 - View Document

PDF Document

DocID: 1qbUT - View Document

NARROW OPERATORS AND THE DAUGAVET PROPERTY FOR ULTRAPRODUCTS DMITRIY BILIK, VLADIMIR KADETS, ROMAN SHVIDKOY, AND DIRK WERNER Abstract. We show that if T is a narrow operator (for the definition see below) on X = X1 ⊕1

NARROW OPERATORS AND THE DAUGAVET PROPERTY FOR ULTRAPRODUCTS DMITRIY BILIK, VLADIMIR KADETS, ROMAN SHVIDKOY, AND DIRK WERNER Abstract. We show that if T is a narrow operator (for the definition see below) on X = X1 ⊕1

DocID: 1pUCA - View Document