Zdenek Sawa, Petr Jancar Behavioural Equivalences on Finite-State Systems are PTIME-hard. [Citation Graph (0, 0)][DBLP] Computers and Artificial Intelligence, 2005, v:24, n:5, pp:- [Journal]

Martin Kot, Zdenek Sawa Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:49-60 [Journal]

Petr Jancar, Zdenek Sawa A note on emptiness for alternating finite automata with a one-letter alphabet. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:5, pp:164-167 [Journal]