Foundations of Software Science and Computation Structures

DOI10.1007/B95995zbMATH Open1126.68451OpenAlexW3105029025MaRDI QIDQ5308463FDOQ5308463

Authors: Antoine Meyer 

Publication date: 28 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95995

Recommendations

• Publication:4508292
• scientific article; zbMATH DE number 897902
• scientific article; zbMATH DE number 4006231
• Bottom-up rewriting for words and terms
• Rational term rewriting revisited: decidability and confluence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (13)

• An Automata Theoretic Approach to Rational Tree Relations
• Title not available (Why is that?)
• Rewrite systems for natural, integral, and rational arithmetic
• Using the TPTP Language for Writing Derivations and Finite Interpretations
• Right-linear half-monadic term rewrite systems
• Bottom-up rewriting for words and terms
• Object-oriented data as prefix rewriting systems
• Term rewriting systems as topological dynamical systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the descriptive power of term rewriting systems
• Title not available (Why is that?)

This page was built for publication: Foundations of Software Science and Computation Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5308463)