Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata

DOI10.1007/978-3-642-24372-1_18zbMath1348.68105OpenAlexW173662904MaRDI QIDQ3172918

Ondřej Lengál, Tomáš Vojnar, Lukáš Holík, Jiří Šimáček

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• CUDD