On the Complexity of Symbolic Finite-State Automata
Formal Languages and Automata Theory
2021-07-05 v3 Machine Learning
Abstract
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a state, and the size of the most complex transition predicate. We pay attention to the special forms of SFAs: {normalized SFAs} and {neat SFAs}, as well as to SFAs over a {monotonic} effective Boolean algebra.
Keywords
Cite
@article{arxiv.2011.05389,
title = {On the Complexity of Symbolic Finite-State Automata},
author = {Dana Fisman and Hadar Frenkel and Sandra Zilles},
journal= {arXiv preprint arXiv:2011.05389},
year = {2021}
}