Visibly Tree Automata with Memory and Constraints

DOI10.2168/LMCS-4(2:8)2008MaRDI QIDQ3518284zbMATH OpenFDO

Authors Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Publication date 7 August 2008

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

Full work available at URL https://doi.org/10.2168/LMCS-4(2:8)2008

zbMATH Keywords

Boolean closuretree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tree Automata with Memory, Visibility and Structural Constraints
• scientific article; zbMATH DE number 1754629
• Bottom-Up Tree Automata with Term Constraints
• Tree automata with global constraints
• Tree Automata with Global Constraints
• Weighted tree automata with constraints
• scientific article; zbMATH DE number 3854429
• Tree automata
• On a representation of tree automata
• Tree automata with global constraints for infinite trees

Cited in

(6)

• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
• Proving Group Protocols Secure Against Eavesdroppers
• scientific article; zbMATH DE number 1886076 (Why is no real title available?)
• Rigid tree automata and applications
• Tree Automata with Memory, Visibility and Structural Constraints

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

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