Tree Automata with Memory, Visibility and Structural Constraints

DOI10.1007/978-3-540-71389-0_13MaRDI QIDQ5758053zbMATH OpenOpenAlexFDO

Authors Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Visibly Tree Automata with Memory and Constraints
• Bottom-Up Tree Automata with Term Constraints
• scientific article; zbMATH DE number 4213435
• Tree-stack automata
• Rigid tree automata and applications

Cited in

(14)

• Parameterized complexity of basic decision problems for tree automata
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• scientific article; zbMATH DE number 4213435 (Why is no real title available?)
• Visibly Tree Automata with Memory and Constraints
• Proving Group Protocols Secure Against Eavesdroppers
• Automated Induction with Constrained Tree Automata
• Parameter Reduction in Grammar-Compressed Trees
• Rigid Tree Automata
• Nested Sibling Tree Automata
• Parameter reduction and automata evaluation for grammar-compressed trees
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• scientific article; zbMATH DE number 7360252 (Why is no real title available?)
• Rigid tree automata and applications
• Automata-based verification of programs with tree updates

This page was built for publication: Tree Automata with Memory, Visibility and Structural Constraints

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