Zdeněk Sawa

Available identifiers

Publication	Date of Publication	Type
Countdown games, and simulation on (succinct) one-counter nets	2023-03-22	Paper
EXPSPACE-complete variant of countdown games, and simulation on succinct one-counter nets	2018-10-23	Paper
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time	2013-10-02	Paper
Complexity of checking bisimilarity between sequential and parallel processes	2013-09-20	Paper
Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata	2013-04-18	Paper
Complexity of deciding bisimilarity between normed BPA and normed BPP	2010-10-07	Paper
Efficient construction of semilinear representations of languages accepted by unary NFA	2010-08-31	Paper
Equivalence checking of non-flat systems is EXPTIME-hard.	2010-03-30	Paper
A note on emptiness for alternating finite automata with a one-letter alphabet	2010-03-24	Paper
Non-interleaving bisimulation equivalences on basic parallel processes	2010-01-12	Paper
Hardness of equivalence checking for composed finite-state systems	2009-05-08	Paper
Normed BPA vs. Normed BPP Revisited	2008-11-25	Paper
Behavioural equivalences on finite-state systems are PTIME-hard	2007-03-07	Paper
DP lower bounds for equivalence-checking and model-checking of one-counter automata	2004-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4738225	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4474001	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4496250	2000-08-13	Paper

This page was built for person: Zdeněk Sawa