Characterizing Conclusive Approximations by Logical Formulae

DOI10.1007/978-3-642-24288-5_8zbMath1348.68081OpenAlexW113887578MaRDI QIDQ3172866

Valérie Murat, Thi-Bich-Hanh Dao, Yohan Boichut

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (1)

Termination criteria for tree automata completion

This page was built for publication: Characterizing Conclusive Approximations by Logical Formulae