# Zdenek Sawa

According to our database

Collaborative distances:

^{1}, Zdenek Sawa authored at least 17 papers between 1999 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

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

CoRR, 2018

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

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

2013

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

Fundam. Inform., 2013

Complexity of Checking Bisimilarity between Sequential and Parallel Processes.

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2010

Complexity of deciding bisimilarity between normed BPA and normed BPP.

Inf. Comput., 2010

Non-interleaving bisimulation equivalences on Basic Parallel Processes.

Inf. Comput., 2010

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

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

2009

Hardness of equivalence checking for composed finite-state systems.

Acta Inf., 2009

2008

Normed BPA vs. Normed BPP Revisited.

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.

Inf. Process. Lett., 2007

2005

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

Electr. Notes Theor. Comput. Sci., 2005

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

Computers and Artificial Intelligence, 2005

2004

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

Inf. Comput., 2004

2003

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

Proceedings of the CONCUR 2003, 2003

2002

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

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

2001

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

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.

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