Autor:	Torres, David Fernando Casas
Rok vydání:	2021
Předmět:	Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2110.05173 Zobrazit plný text záznamu View this record from Arxiv