A completion algorithm for lattice tree automata

DOI10.1007/978-3-642-39274-0_13MaRDI QIDQ5327489zbMATH OpenOpenAlexFDO

Authors Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat

Publication date 7 August 2013

Published in Implementation and Application of Automata (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
• scientific article; zbMATH DE number 1903380
• Completeness of tree automata completion
• Tree regular model checking: a simulation-based approach
• Certifying a Tree Automata Completion Checker

Cited in

(8)

• The complexity of computing the behaviour of lattice automata on infinite trees
• Rewriting modulo SMT and open system analysis
• Certifying a Tree Automata Completion Checker
• Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
• Lifting numeric relational domains to algebraic data types
• Formula normalizations in verification
• An input-output relational domain for algebraic data types and functional arrays
• Termination criteria for tree automata completion

This page was built for publication: A completion algorithm for lattice tree automata

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