Zdenek Sawa

According to our database, Zdenek Sawa authored at least 18 papers between 1999 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Countdown games, and simulation on (succinct) one-counter nets.

Petr Jancar, Petr Osicka, Zdenek Sawa

Log. Methods Comput. Sci., 2023

2018

EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets.

Petr Jancar, Petr Osicka, Zdenek Sawa

CoRR, 2018

EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets.

Petr Jancar, Petr Osicka, Zdenek Sawa

Proceedings of the Reachability Problems - 12th International Conference, 2018

2013

Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata.

Zdenek Sawa

Fundam. Informaticae, 2013

Complexity of Checking Bisimilarity between Sequential and Parallel Processes.

Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2010

Complexity of deciding bisimilarity between normed BPA and normed BPP.

Petr Jancar, Martin Kot, Zdenek Sawa

Inf. Comput., 2010

Non-interleaving bisimulation equivalences on Basic Parallel Processes.

Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa

Inf. Comput., 2010

Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA.

Zdenek Sawa

Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009

Hardness of equivalence checking for composed finite-state systems.

Zdenek Sawa, Petr Jancar

Acta Informatica, 2009

2008

Normed BPA vs. Normed BPP Revisited.

Petr Jancar, Martin Kot, Zdenek Sawa

Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007

A note on emptiness for alternating finite automata with a one-letter alphabet.

Petr Jancar, Zdenek Sawa

Inf. Process. Lett., 2007

2005

Behavioural Equivalences on Finite-State Systems are PTIME-hard.

Zdenek Sawa, Petr Jancar

Comput. Artif. Intell., 2005

2004

DP lower bounds for equivalence-checking and model-checking of one-counter automata.

Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa

Inf. Comput., 2004

Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time.

Martin Kot, Zdenek Sawa

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

2003

Equivalence Checking of Non-Flat Systems Is EXPTIME-hard.

Zdenek Sawa

Proceedings of the CONCUR 2003, 2003

2002

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.

Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

P-Hardness of Equivalence Testing on Finite-State Processes.

Zdenek Sawa, Petr Jancar

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

1999

Simulation Problems for One-Counter Machines.

Petr Jancar, Faron Moller, Zdenek Sawa

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999