Bottom-Up Rewriting Is Inverse Recognizability Preserving

DOI10.1007/978-3-540-73449-9_10zbMath1203.68070OpenAlexW1506358362MaRDI QIDQ5432336

Irène Durand, Géraud Sénizergues

Publication date: 2 January 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_10

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ Normalization properties for shallow TRS and innermost rewriting ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Bottom-up rewriting for words and terms

This page was built for publication: Bottom-Up Rewriting Is Inverse Recognizability Preserving