Pages that link to "Item:Q5684229"
From MaRDI portal
The following pages link to Tree-Manipulating Systems and Church-Rosser Theorems (Q5684229):
Displaying 50 items.
- Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent (Q407556) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- Decidable sentences of Church-Rosser congruences (Q593775) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Algebraic and operational semantics of specifications allowing exceptions and errors (Q759478) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- Attacking a public key cryptosystem based on tree replacement (Q858300) (← links)
- Chain properties of rule closures (Q916402) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- On the correspondence between two classes of reduction systems (Q1059392) (← links)
- Axiomatisation des tests (Q1062748) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Termination of rewriting (Q1098624) (← links)
- The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Confluence of indirection reductions in graph rewrite systems (Q1113692) (← links)
- Deterministic tree pushdown automata and monadic tree rewriting systems (Q1118421) (← links)
- Final algebra semantics and data type extensions (Q1131834) (← links)
- Optimal evaluations of graph-like expressions (Q1136217) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Speeding up subtree replacement systems (Q1142046) (← links)
- Persistence of vector replacement systems is decidable (Q1149775) (← links)
- An algebraic definition for control structures (Q1151016) (← links)
- A modified tree-to-tree correction problem (Q1152712) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- Testing for the Church-Rosser property (Q1162144) (← links)
- Recognizable formal power series on trees (Q1164440) (← links)
- Graph grammars and operational semantics (Q1165029) (← links)
- Monadic Thue systems (Q1165842) (← links)
- When is a monoid a group? The Church-Rosser case is tractable (Q1166924) (← links)
- Mixed computation: potential applications and problems for study (Q1169808) (← links)
- Confluence of the lambda calculus with left-linear algebraic rewriting (Q1197987) (← links)
- Deriving graphs from graphs by applying a production (Q1215276) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- Least fixed points revisited (Q1234588) (← links)
- Correctness of parallel programs: The Church-Rosser approach (Q1241051) (← links)
- On reduction of asynchronous systems (Q1241274) (← links)
- IO and OI. I (Q1241985) (← links)
- Synchronization and computing capabilities of linear asynchronous structures (Q1242906) (← links)
- IO and OI. II (Q1243578) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- Addressable approximations to nonaddressable data graphs (Q1248365) (← links)
- (A-)synchronous (non)-deterministic cell spaces simulating each other (Q1253921) (← links)
- Church-Rosser strategies in the lambda calculus (Q1256442) (← links)
- Diagram techniques for confluence (Q1271472) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- Confluence by decreasing diagrams (Q1322164) (← links)
- Some results on the confluence property of combined term rewriting systems (Q1337642) (← links)
- Developing developments (Q1392147) (← links)
