Restricting tree grammars with term rewriting

DOI10.4230/LIPICS.FSCD.2022.14MaRDI QIDQ6544109zbMATH OpenFDO

Authors Jan Bessai, Łukasz Czajka, Felix Laarmann, Jakob Rehof

Publication date 27 May 2024

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2022.14

zbMATH Keywords

emptinessfinitenessnormalizationterm rewritingtree automatatree grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 18637
• scientific article; zbMATH DE number 176501
• scientific article; zbMATH DE number 4016185
• Tree automata for rewrite strategies
• scientific article; zbMATH DE number 1354853

Cited in

(1)

• Finite combinatory logic with predicates

This page was built for publication: Restricting tree grammars with term rewriting

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