Rewriting preserving recognizability of finite tree languages

DOI10.1016/J.JLAP.2012.10.002zbMath1278.68127OpenAlexW1851275423MaRDI QIDQ1936231

Sándor Vágvölgyi

Publication date: 21 February 2013

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2012.10.002

zbMATH Keywords

tree automataterm rewritingtree languagesrecognizabilityterm rewrite systemsdecidability questions

Mathematics Subject Classification ID

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

This page was built for publication: Rewriting preserving recognizability of finite tree languages