A Completion Algorithm for Lattice Tree Automata

DOI10.1007/978-3-642-39274-0_13zbMath1298.68135OpenAlexW2198174543MaRDI QIDQ5327489

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

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)

Related Items

Rewriting modulo SMT and open system analysis, Lifting numeric relational domains to algebraic data types, Termination criteria for tree automata completion