Visibly Pushdown Languages and Term Rewriting

DOI10.1007/978-3-540-74621-8_17zbMATH Open1148.68392OpenAlexW1541556120MaRDI QIDQ3525014FDOQ3525014

Authors: Jacques Chabin, Pierre Réty 

Publication date: 16 September 2008

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74621-8_17

Recommendations

• scientific article; zbMATH DE number 176501
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Publication:4934355
• Rewriting preserving recognizability of finite tree languages
• scientific article; zbMATH DE number 794243

zbMATH Keywords

term rewritingtree languages

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Controlled term rewriting
• Rigid tree automata and applications
• Rigid Tree Automata

This page was built for publication: Visibly Pushdown Languages and Term Rewriting

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