Automata modulo theories
L D'Antoni, M Veanes - Communications of the ACM, 2021 - dl.acm.org
Communications of the ACM, 2021•dl.acm.org
Automata modulo theories Page 1 86 COMMUNICATIONS OF THE ACM | MAY 2021 | VOL. 64
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one
of the most fundamental models of computation and are taught in almost all undergraduate
computer-science curricula. Although automata are typically presented as a theoretical model
of computation, they have found their place in a variety of practical applications, such as
natural language processing, networking, program verification, and regular-expression …
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one
of the most fundamental models of computation and are taught in almost all undergraduate
computer-science curricula. Although automata are typically presented as a theoretical model
of computation, they have found their place in a variety of practical applications, such as
natural language processing, networking, program verification, and regular-expression …
Symbolic automata better balances how automata are implemented in practice.