- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j8 |      | Zdenek Sawa: Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata. Fundam. Inform. 123(1): 97-106 (2013) |
| 2010 | ||
| j7 | | Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa: Non-interleaving bisimulation equivalences on Basic Parallel Processes. Inf. Comput. 208(1): 42-62 (2010) |
| j6 | | Petr Jancar, Martin Kot, Zdenek Sawa: Complexity of deciding bisimilarity between normed BPA and normed BPP. Inf. Comput. 208(10): 1193-1205 (2010) |
| c6 | | Zdenek Sawa: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. RP 2010: 176-182 |
| 2009 | ||
| j5 | | Zdenek Sawa, Petr Jancar: Hardness of equivalence checking for composed finite-state systems. Acta Inf. 46(3): 169-191 (2009) |
| 2008 | ||
| c5 | | |
| 2007 | ||
| j4 | | Petr 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 | ||
| j3 | | Zdenek Sawa, Petr Jancar: Behavioural Equivalences on Finite-State Systems are PTIME-hard. Computers and Artificial Intelligence 24(5): 513-528 (2005) |
| j2 | | Martin 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 | ||
| j1 | | Petr 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 | ||
| c4 | | |
| 2002 | ||
| c3 | | Petr 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 | ||
| c2 | | Zdenek Sawa, Petr Jancar: P-Hardness of Equivalence Testing on Finite-State Processes. SOFSEM 2001: 326-335 |
| 1999 | ||
| c1 | | Petr Jancar, Faron Moller, Zdenek Sawa: Simulation Problems for One-Counter Machines. SOFSEM 1999: 404-413 |
| 1 | Sibylle B. Fröschle | |
| 2 | Petr Jancar | |
| 3 | Martin Kot | |
| 4 | Antonín Kucera | |
| 5 | Slawomir Lasota | |
| 6 | Faron Moller |
Data released under the ODC-BY 1.0 license — See also our legal information page