The size-cost of Boolean operations on constant height deterministic pushdown automata. - Zuzana Bednárová; Viliam Geffert; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2012)

Removing nondeterminism in constant height pushdown automata. - Zuzana Bednárová; Viliam Geffert; Carlo Mereghetti; Beatrice Palano (Inf. Comput., 2014)

New Results on the Minimum Amount of Useful Space. - Zuzana Bednárová; Viliam Geffert; Klaus Reinhardt; Abuzer Yakaryilmaz (Int. J. Found. Comput. Sci., 2016)

Two double-exponential gaps for automata with a limited pushdown. - Zuzana Bednárová; Viliam Geffert (Inf. Comput., 2017)

Boolean language operations on nondeterministic automata with a pushdown of constant height. - Zuzana Bednárová; Viliam Geffert; Carlo Mereghetti; Beatrice Palano (J. Comput. Syst. Sci., 2017)

Minimal Useful Size of Counters for (Real-Time) Multicounter Automata. - Viliam Geffert; Zuzana Bednárová (MCU, 2018)

Minimal Size of Counters for (Real-Time) Multicounter Automata. - Viliam Geffert; Zuzana Bednárová (Fundam. Informaticae, 2021)

Input-driven pushdown automata for edit distance neighborhood. - Viliam Geffert; Zuzana Bednárová; Alexander Szabari (Theor. Comput. Sci., 2022)