Visibly Tree Automata with Memory and Constraints

DOI10.2168/LMCS-4(2:8)2008zbMath1149.68045MaRDI QIDQ3518284

Nicolas Perrin, Florent Jacquemard, Hubert Comon-Lundh

Publication date: 7 August 2008

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

tree languagesBoolean closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

The emptiness problem for tree automata with at least one global disequality constraint is NP-hard ⋮ Proving Group Protocols Secure Against Eavesdroppers ⋮ Rigid tree automata and applications

This page was built for publication: Visibly Tree Automata with Memory and Constraints