Petr Jančar

1. Undecidability of bisimilarity by defender's forcing
   2008/02/01 by Petr Jančar, Jǐŕı Srba · 2 citations
   Computer Science · #Formal Methods in Verification #Logic, programming, and type systems #semigroups and automata theory
2. Equivalence of Deterministic One-Counter Automata is NL-complete
   2013/01/10 by Stanislav Böhm, Stefan Göller, Böhm, Stanislav +3 · 1 citation
   Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL