Visibly Pushdown Languages and Term Rewriting

DOI10.1007/978-3-540-74621-8_17zbMath1148.68392OpenAlexW1541556120MaRDI QIDQ3525014

Pierre Réty, Jacques Chabin

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

zbMATH Keywords

term rewritingtree languages

Mathematics Subject Classification ID

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

Related Items (3)

Controlled Term Rewriting ⋮ Rigid tree automata and applications ⋮ Rigid Tree Automata

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