The SCEAS System
Navigation Menu

Search the dblp DataBase


Zdenek Sawa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zdenek Sawa
    Equivalence Checking of Non-Flat Systems Is EXPTIME-hard. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:233-248 [Conf]
  2. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:172-186 [Conf]
  3. Petr Jancar, Faron Moller, Zdenek Sawa
    Simulation Problems for One-Counter Machines. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:404-413 [Conf]
  4. Zdenek Sawa, Petr Jancar
    P-Hardness of Equivalence Testing on Finite-State Processes. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:326-335 [Conf]
  5. Zdenek Sawa, Petr Jancar
    Behavioural Equivalences on Finite-State Systems are PTIME-hard. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2005, v:24, n:5, pp:- [Journal]
  6. Martin Kot, Zdenek Sawa
    Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:49-60 [Journal]
  7. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    DP lower bounds for equivalence-checking and model-checking of one-counter automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:1-19 [Journal]
  8. Petr Jancar, Zdenek Sawa
    A note on emptiness for alternating finite automata with a one-letter alphabet. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:5, pp:164-167 [Journal]

  9. Normed BPA vs. Normed BPP Revisited. [Citation Graph (, )][DBLP]

  10. Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. [Citation Graph (, )][DBLP]

  11. Hardness of equivalence checking for composed finite-state systems. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002