×
Compute Distance To:
Author ID: sawa.zdenek Recent zbMATH articles by "Sawa, Zdeněk"
Published as: Sawa, Zdeněk; Sawa, Zdenek
Documents Indexed: 16 Publications since 1999
Co-Authors: 8 Co-Authors with 13 Joint Publications
147 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 42 times in 35 Documents Cited by Year
Behavioural equivalences on finite-state systems are PTIME-hard. Zbl 1109.68052
Sawa, Zdeněk; Jančar, Petr
6
2005
Simulation problems for one-counter machines. Zbl 0963.68094
Jančar, Petr; Moller, Faron; Sawa, Zdeněk
6
1999
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
5
2004
A note on emptiness for alternating finite automata with a one-letter alphabet. Zbl 1184.68317
Jančar, Petr; Sawa, Zdeněk
5
2007
Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444
Fröschle, Sibylle; Jančar, Petr; Lasota, Slawomir; Sawa, Zdeněk
4
2010
Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
3
2002
Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata. Zbl 1281.68146
Sawa, Zdeněk
2
2013
Efficient construction of semilinear representations of languages accepted by unary NFA. Zbl 1287.68100
Sawa, Zdeněk
2
2010
Hardness of equivalence checking for composed finite-state systems. Zbl 1166.68018
Sawa, Zdeněk; Jančar, Petr
2
2009
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. Zbl 1272.68309
Kot, Martin; Sawa, Zdeněk
2
2005
P-hardness of equivalence testing on finite-state processes. Zbl 1052.68093
Sawa, Zdenek; Jančar, Petr
2
2001
Equivalence checking of non-flat systems is EXPTIME-hard. Zbl 1274.68134
Sawa, Zdeněk
2
2003
Normed BPA vs. normed BPP revisited. Zbl 1160.68468
Jančar, Petr; Kot, Martin; Sawa, Zdeněk
1
2008
Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata. Zbl 1281.68146
Sawa, Zdeněk
2
2013
Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444
Fröschle, Sibylle; Jančar, Petr; Lasota, Slawomir; Sawa, Zdeněk
4
2010
Efficient construction of semilinear representations of languages accepted by unary NFA. Zbl 1287.68100
Sawa, Zdeněk
2
2010
Hardness of equivalence checking for composed finite-state systems. Zbl 1166.68018
Sawa, Zdeněk; Jančar, Petr
2
2009
Normed BPA vs. normed BPP revisited. Zbl 1160.68468
Jančar, Petr; Kot, Martin; Sawa, Zdeněk
1
2008
A note on emptiness for alternating finite automata with a one-letter alphabet. Zbl 1184.68317
Jančar, Petr; Sawa, Zdeněk
5
2007
Behavioural equivalences on finite-state systems are PTIME-hard. Zbl 1109.68052
Sawa, Zdeněk; Jančar, Petr
6
2005
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. Zbl 1272.68309
Kot, Martin; Sawa, Zdeněk
2
2005
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
5
2004
Equivalence checking of non-flat systems is EXPTIME-hard. Zbl 1274.68134
Sawa, Zdeněk
2
2003
Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653
Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk
3
2002
P-hardness of equivalence testing on finite-state processes. Zbl 1052.68093
Sawa, Zdenek; Jančar, Petr
2
2001
Simulation problems for one-counter machines. Zbl 0963.68094
Jančar, Petr; Moller, Faron; Sawa, Zdeněk
6
1999

Citations by Year