Zdenek Sawa

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 4

Top Topics

Simulation Environment

Finite Automaton

Top Venues

Fundam. Informaticae

Publications

Petr Jancar, Petr Osicka, Zdenek Sawa
Countdown games, and simulation on (succinct) one-counter nets. Log. Methods Comput. Sci. 19 (1) (2023)
Petr Jancar, Petr Osicka, Zdenek Sawa
Countdown games, and simulation on (succinct) one-counter nets. CoRR (2020)
Petr Jancar, Petr Osicka, Zdenek Sawa
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets. RP (2018)
Petr Jancar, Petr Osicka, Zdenek Sawa
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets. CoRR (2018)
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. MFCS (2013)
Zdenek Sawa
Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata. Fundam. Informaticae 123 (1) (2013)
Zdenek Sawa
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. RP (2010)
Petr Jancar, Martin Kot, Zdenek Sawa
Complexity of deciding bisimilarity between normed BPA and normed BPP. Inf. Comput. 208 (10) (2010)
Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa
Non-interleaving bisimulation equivalences on Basic Parallel Processes. Inf. Comput. 208 (1) (2010)
Zdenek Sawa, Petr Jancar
Hardness of equivalence checking for composed finite-state systems. Acta Informatica 46 (3) (2009)
Petr Jancar, Martin Kot, Zdenek Sawa
Normed BPA vs. Normed BPP Revisited. CONCUR (2008)
Petr Jancar, Zdenek Sawa
A note on emptiness for alternating finite automata with a one-letter alphabet. Inf. Process. Lett. 104 (5) (2007)
Zdenek Sawa, Petr Jancar
Behavioural Equivalences on Finite-State Systems are PTIME-hard. Comput. Artif. Intell. 24 (5) (2005)
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Inf. Comput. 188 (1) (2004)
Martin Kot, Zdenek Sawa
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. INFINITY (2004)
Zdenek Sawa
Equivalence Checking of Non-Flat Systems Is EXPTIME-hard. CONCUR (2003)
Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. FoSSaCS (2002)
Zdenek Sawa, Petr Jancar
P-Hardness of Equivalence Testing on Finite-State Processes. SOFSEM (2001)
Petr Jancar, Faron Moller, Zdenek Sawa
Simulation Problems for One-Counter Machines. SOFSEM (1999)