Tree Automata, (Dis-)Equality Constraints and Term Rewriting

DOI10.1007/978-3-642-21691-6_2zbMath1331.68140OpenAlexW2397493558MaRDI QIDQ3007653

Sophie Tison

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21691-6_2

Mathematics Subject Classification ID

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

Related Items (1)

Weighted tree automata with constraints

Cites Work

• Rigid tree automata and applications
• The HOM problem is decidable
• TREE AUTOMATA WITH GLOBAL CONSTRAINTS

This page was built for publication: Tree Automata, (Dis-)Equality Constraints and Term Rewriting