5
votes
2answers
247 views

Isomorphism in category of finite automata

What does meanthat two finite automata is equivalent? I think that we must define category of finite automata, i.e. we must define $\mathrm{Hom}(A,B)$, where $A,B$ be an arbitrary finite automata. ...
1
vote
0answers
154 views

What is this structure called?

(I'm not entirely sure what to tag this; feel free to retag.) While thinking about automata (specifics below), I ran into the following phenomenon: A cofunction system is a pair of sets $X, A$, ...
5
votes
0answers
183 views

“Question-answer” bisimulation

I often come across relations that would be defined as a bisimulation, except that the label match can be "inexact", that is, in the bisimulation game, a move labelled with "a" can be replied to with ...