Tree Automata with Memory, Visibility and Structural Constraints
From MaRDI portal
Publication:5758053
DOI10.1007/978-3-540-71389-0_13zbMath1195.68054OpenAlexW2167567138MaRDI QIDQ5758053
Florent Jacquemard, Hubert Comon-Lundh, 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
Related Items
Automata-based verification of programs with tree updates, Parameter reduction and automata evaluation for grammar-compressed trees, 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, Parameterized complexity of basic decision problems for tree automata
