1 citations · 1 across the 1 of their papers we have counts for
1 paper
Christof Löding, Christopher Spinrath
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relat…