COMPUTING CONVEX HULLS BY AUTOMATA ITERATION

DOI10.1142/S0129054109006796zbMath1194.68134OpenAlexW2023900553MaRDI QIDQ3395136

François Cantin, Pierre Wolper, Axel Legay

Publication date: 21 August 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109006796

zbMATH Keywords

convex hullBüchi automata(\(\omega \)-)regular model checking

Mathematics Subject Classification ID

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

Cites Work

• Alternating finite automata on \(\omega\)-words
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable
• An optimal convex hull algorithm in any fixed dimension
• Efficient minimization of deterministic weak \(\omega\)-automata
• An effective decision procedure for linear arithmetic over the integers and reals

This page was built for publication: COMPUTING CONVEX HULLS BY AUTOMATA ITERATION