default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZdenek Sawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Petr Jancar
, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. Log. Methods Comput. Sci. 19(1) (2023)- 2020
- [i2]Petr Jancar, Petr Osicka, Zdenek Sawa:
Countdown games, and simulation on (succinct) one-counter nets. CoRR abs/2008.11753 (2020)
2010 – 2019
- 2018
- [c9]Petr Jancar, Petr Osicka, Zdenek Sawa:
EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets. RP 2018: 59-74 - [i1]Petr Jancar, Petr Osicka, Zdenek Sawa:
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets. CoRR abs/1801.01073 (2018) - 2013
- [j7]Zdenek Sawa:
Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata. Fundam. Informaticae 123(1): 97-106 (2013) - [c8]Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. MFCS 2013: 302-313 - 2010
- [j6]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) - [j5]Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of deciding bisimilarity between normed BPA and normed BPP. Inf. Comput. 208(10): 1193-1205 (2010) - [c7]Zdenek Sawa:
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA. RP 2010: 176-182
2000 – 2009
- 2009
- [j4]Zdenek Sawa, Petr Jancar:
Hardness of equivalence checking for composed finite-state systems. Acta Informatica 46(3): 169-191 (2009) - 2008
- [c6]Petr Jancar, Martin Kot, Zdenek Sawa:
Normed BPA vs. Normed BPP Revisited. CONCUR 2008: 434-446 - 2007
- [j3]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
- [j2]Zdenek Sawa, Petr Jancar:
Behavioural Equivalences on Finite-State Systems are PTIME-hard. Comput. Artif. Intell. 24(5): 513-528 (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) - [c5]Martin Kot, Zdenek Sawa:
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. INFINITY 2004: 49-60 - 2003
- [c4]Zdenek Sawa:
Equivalence Checking of Non-Flat Systems Is EXPTIME-hard. CONCUR 2003: 233-248 - 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
1990 – 1999
- 1999
- [c1]Petr Jancar, Faron Moller, Zdenek Sawa:
Simulation Problems for One-Counter Machines. SOFSEM 1999: 404-413
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
