default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJozef Jirásek 0002
Person information
- unicode name: Jozef Štefan Jirásek
- affiliation: University of Saskatchewan, SK, Canada
- affiliation (former): Slovak Academy of Sciences, Košice, Slovakia
- not to be confused with: Jozef Jirásek 0001
Other persons with the same name
- Jozef Jirásek 0001
![[0000-0003-4822-230X]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-4822-230X")
— P.J. Šafárik University, Košice, Slovakia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Jozef Jirásek, Ian McQuillan:
Visit-Bounded Stack Automata. Theory Comput. Syst. 67(5): 956-975 (2023)- 2022
- [c11]Jozef Jirásek, Ian McQuillan:
Visit-Bounded Stack Automata. DLT 2022: 189-200 - [i2]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. CoRR abs/2212.00891 (2022) - 2021
- [j3]Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. Int. J. Found. Comput. Sci. 32(6): 801-823 (2021) - 2020
- [c10]Oscar H. Ibarra, Jozef Jirásek Jr., Ian McQuillan, Luca Prigioniero:
Space Complexity of Stack Automata Models. DLT 2020: 137-149
2010 – 2019
- 2019
- [j2]Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej:
Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation. Int. J. Found. Comput. Sci. 30(6-7): 1091-1115 (2019) - 2018
- [j1]Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej:
Operations on Unambiguous Finite Automata. Int. J. Found. Comput. Sci. 29(5): 861-876 (2018) - [c9]Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.:
Computational Complexity of Decision Problems on Self-verifying Finite Automata. DLT 2018: 404-415 - 2017
- [c8]Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej:
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. DCFS 2017: 189-201 - 2016
- [c7]Jozef Jirásek Jr.:
Non-regular Maximal Prefix-Free Subsets of Regular Languages. DLT 2016: 229-242 - [c6]Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej:
Operations on Unambiguous Finite Automata. DLT 2016: 243-255 - [c5]Jozef Jirásek Jr., Juraj Sebej:
Kuratowski Algebras Generated by Prefix-Free Languages. CIAA 2016: 150-162 - 2015
- [c4]Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari:
Operations on Self-Verifying Finite Automata. CSR 2015: 231-261 - [c3]Jozef Stefan Jirásek, Juraj Sebej:
Prefix-Free Subsets of Regular Languages and Descriptional Complexity. DCFS 2015: 129-140 - 2011
- [c2]Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. WG 2011: 83-94 - [i1]Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. CoRR abs/1108.0064 (2011) - 2010
- [c1]Jozef Jirásek, Pavel Klavík:
Structural and Complexity Aspects of Line Systems of Graphs. ISAAC (1) 2010: 157-168
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-09-13 01:37 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:
