A Characterization of Totally Compatible Automata
Formal Languages and Automata Theory
2021-10-12 v1
Abstract
Every function on a finite set defines an equivalence relation and, therefore, a partition called the kernel of the function. Automata such that every possible partition is the kernel of a word are called totally compatible. A characterization of such automata is given together with an algorithm to recognize them in polynomial running time with respect to the number of states.
Cite
@article{arxiv.2110.05173,
title = {A Characterization of Totally Compatible Automata},
author = {David Fernando Casas Torres},
journal= {arXiv preprint arXiv:2110.05173},
year = {2021}
}