Travelled to:
1 × USA
Collaborated with:
S.Göller P.Jancar
Talks about:
determinist (1) automata (1) equival (1) counter (1) complet (1) one (1)
Person: Stanislav Böhm
DBLP: B=ouml=hm:Stanislav
Contributed to:
Wrote 1 papers:
- STOC-2013-BohmGJ #automaton #equivalence
- Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.