3 citations · 3 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2019
Haydi: Rapid Prototyping and Combinatorial Objects
Stanislav Böhm, Jakub Beránek, Martin Šurkovský
Haydi (http://haydi.readthedocs.io) is a framework for generating discrete structures. It provides a way to define a structure from basic building blocks and then enumerate all ele…
cs.FL2013
Equivalence of Deterministic One-Counter Automata is NL-complete
Stanislav Böhm, Stefan Göller, Petr Jančar
We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson…