Bottom-up tree pushdown automata and rewrite systems
From MaRDI portal
Publication:5055768
DOI10.1007/3-540-53904-2_104zbMath1503.68096OpenAlexW1526145713MaRDI QIDQ5055768
Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-53904-2_104
rewrite systemstree languagesconvergent systemstree automatonterm rewrite systemsChurch-Rosser systemsNoetherian systemspushdown store
Related Items (5)
Bottom-up tree pushdown automata: Classification and connection with rewrite systems ⋮ Bottom-up tree pushdown automata and rewrite systems ⋮ Tree automata for rewrite strategies ⋮ Termination criteria for tree automata completion ⋮ Handling Left-Quadratic Rules When Completing Tree Automata
Cites Work
- Tree pushdown automata
- Reductions in tree replacement systems
- Thue systems as rewriting systems
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Monadic Thue systems
- Pushdown tree automata
- Semantic confluence tests and completion methods
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Bottom-up tree pushdown automata and rewrite systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bottom-up tree pushdown automata and rewrite systems