| ||||
| ||||
![]() Title:Symbolic Register Automata Conference:CAV 2019 Tags:back reference, boolean closure, decidability property, decision procedure, first order alphabet theory, infinite alphabet, language equivalence, language inclusion, register automata and symbolic automata Abstract: Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right. In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms for emptiness, inclusion and equivalence checking, together with experimental results. Symbolic Register Automata ![]() Symbolic Register Automata | ||||
Copyright © 2002 – 2025 EasyChair |