Edit Profile (opens in new tab) Sawa, Zdeněk Compute Distance To: Compute Author ID: sawa.zdenek 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 all top 5 Co-Authors 3 single-authored 12 Jančar, Petr 4 Kot, Martin 3 Moller, Faron 2 Kucera, Antonin 1 Czerwiński, Wojciech 1 Fröschle, Sibylle B. 1 Lasota, Sławomir 1 Osicka, Petr Serials 3 Information and Computation 1 Acta Informatica 1 Information Processing Letters 1 Fundamenta Informaticae 1 Computing and Informatics Fields 16 Computer science (68-XX) 1 Systems theory; control (93-XX) Publications by Year all cited Publications top 5 cited Publications 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.68052Sawa, Zdeněk; Jančar, Petr 6 2005 Simulation problems for one-counter machines. Zbl 0963.68094Jančar, Petr; Moller, Faron; Sawa, Zdeněk 6 1999 DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087Janč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.68317Jančar, Petr; Sawa, Zdeněk 5 2007 Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444Frö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.68653Janč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.68146Sawa, Zdeněk 2 2013 Efficient construction of semilinear representations of languages accepted by unary NFA. Zbl 1287.68100Sawa, Zdeněk 2 2010 Hardness of equivalence checking for composed finite-state systems. Zbl 1166.68018Sawa, 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.68309Kot, Martin; Sawa, Zdeněk 2 2005 P-hardness of equivalence testing on finite-state processes. Zbl 1052.68093Sawa, Zdenek; Jančar, Petr 2 2001 Equivalence checking of non-flat systems is EXPTIME-hard. Zbl 1274.68134Sawa, Zdeněk 2 2003 Normed BPA vs. normed BPP revisited. Zbl 1160.68468Jančar, Petr; Kot, Martin; Sawa, Zdeněk 1 2008 Efficient construction of semilinear representations of languages accepted by unary nondeterministic finite automata. Zbl 1281.68146Sawa, Zdeněk 2 2013 Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444Frö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.68100Sawa, Zdeněk 2 2010 Hardness of equivalence checking for composed finite-state systems. Zbl 1166.68018Sawa, Zdeněk; Jančar, Petr 2 2009 Normed BPA vs. normed BPP revisited. Zbl 1160.68468Jančar, Petr; Kot, Martin; Sawa, Zdeněk 1 2008 A note on emptiness for alternating finite automata with a one-letter alphabet. Zbl 1184.68317Jančar, Petr; Sawa, Zdeněk 5 2007 Behavioural equivalences on finite-state systems are PTIME-hard. Zbl 1109.68052Sawa, 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.68309Kot, Martin; Sawa, Zdeněk 2 2005 DP lower bounds for equivalence-checking and model-checking of one-counter automata. Zbl 1078.68087Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk 5 2004 Equivalence checking of non-flat systems is EXPTIME-hard. Zbl 1274.68134Sawa, Zdeněk 2 2003 Equivalence-checking with one-counter automata: A generic method for proving lower bounds. Zbl 1077.68653Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk 3 2002 P-hardness of equivalence testing on finite-state processes. Zbl 1052.68093Sawa, Zdenek; Jančar, Petr 2 2001 Simulation problems for one-counter machines. Zbl 0963.68094Jančar, Petr; Moller, Faron; Sawa, Zdeněk 6 1999 all cited Publications top 5 cited Publications all top 5 Cited by 54 Authors 5 Jančar, Petr 4 Demri, Stéphane P. 3 Kiefer, Stefan 3 Kucera, Antonin 3 Nagy, Benedek 3 Otto, Friedrich 3 Sawa, Zdeněk 2 Beneš, Nikola 2 Fröschle, Sibylle B. 2 Göller, Stefan 2 Gorrieri, Roberto 2 Haase, Christoph 2 Křetínský, Jan 2 Larsen, Kim Guldstrand 2 Lasota, Sławomir 2 Lohrey, Markus 2 Srba, Jiří 2 Worrell, James B. 1 Bandyopadhyay, Soumyadip 1 Belardinelli, Francesco 1 Bozzelli, Laura 1 Brázdil, Tomáš 1 Chen, Haiming 1 Czerwiński, Wojciech 1 Doyen, Laurent 1 Ésik, Zoltán 1 Esparza, Javier 1 Forejt, Vojtěch 1 Ganardi, Moses 1 Gascon, Régis 1 Gawrychowski, Paweł 1 Héam, Pierre-Cyrille 1 Kouchnarenko, Olga 1 Kreutzer, Stephan 1 Lazić, Ranko 1 Legay, Axel 1 Lu, Ping 1 Luttenberger, Michael 1 Mandal, Chittaranjan 1 Massart, Thierry Jacques 1 Mayr, Richard M. 1 Moller, Faron 1 Møller, Mikael Harkjær 1 Ouaknine, Joel O. 1 Peng, Feifei 1 Pinchinat, Sophie 1 Sangnier, Arnaud 1 Sarkar, Dipankar 1 Schuppan, Viktor 1 Shirmohammadi, Mahsa 1 Sickert, Salomon 1 To, Anthony Widjaja 1 Voinot, Jérôme 1 Zheng, Lixiao all top 5 Cited in 9 Serials 8 Theoretical Computer Science 5 Acta Informatica 4 Information and Computation 3 Information Processing Letters 2 Journal of Computer and System Sciences 2 Logical Methods in Computer Science 1 Artificial Intelligence 1 Science of Computer Programming 1 RAIRO. Theoretical Informatics and Applications Cited in 3 Fields 35 Computer science (68-XX) 6 Mathematical logic and foundations (03-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Citations by Year