dblp.uni-trier.dewww.uni-trier.de

Zdenek Sawa

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Petr Jancar [1] [2] [3] [5] [7] [8] [9]
2Martin Kot [6] [9]
3Antonín Kucera [3] [5]
4Faron Moller [1] [3] [5]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)