Homomorphisms and concurrent term rewriting

DOI10.1007/3-540-48321-7_40MaRDI QIDQ4934355zbMATH OpenFDO

Authors F. Seynhaeve, Sophie Tison, M. Tommasi

Publication date 17 January 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48321-7_40

zbMATH Keywords

regular tree languagesrewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 794243
• Decision problems for term rewriting systems and recognizable tree languages
• Regular sets of descendants by leftmost strategy
• Regular sets of descendants for constructor-based rewrite systems
• Classes of Tree Homomorphisms with Decidable Preservation of Regularity

Cited in

(8)

• Some decidability results on one-pass reductions
• Tree automata for rewrite strategies
• Weakly regular relations and applications
• Visibly Pushdown Languages and Term Rewriting
• scientific article; zbMATH DE number 4043232 (Why is no real title available?)
• When Homomorphism Becomes a Liability
• Regular sets of descendants for constructor-based rewrite systems
• Bottom-up rewriting for words and terms

This page was built for publication: Homomorphisms and concurrent term rewriting

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