Abstract
This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructed allows a linear-time determinization procedure to be used. Furthermore, it shows through theoretical analysis and experiments that the special structure of the constructed automata does, in quite a general way, render the usual upper bounds on automata operations vastly overpessimistic. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Wolper, P., & Boigelot, B. (2000). On the construction of automata from linear arithmetic constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1785 LNCS, pp. 1–19). Springer Verlag. https://doi.org/10.1007/3-540-46419-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
