A description based on languages of the final non-deterministic automaton
We describe the final non-deterministic automaton with language-based structures. This generalises the language automaton, the final deterministic automaton. Automata bisimilarity is described as a set equality of language-based structures.
non-deterministic automaton bisimilarity formal language coalgebra final automaton