default search action
Jozef Jirásek 0001
Person information
- affiliation: P.J. Šafárik University, Košice, Slovakia
- not to be confused with: Jozef Jirásek 0002
Other persons with the same name
- Jozef Jirásek 0002
(aka: Jozef Jirásek Jr., Jozef Stefan Jirásek) — University of Saskatchewan, SK, Canada (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit:
State Complexity of the Minimal Star Basis. CIAA 2024: 195-207 - 2023
- [c10]Michal Hospodár
Operational Complexity: NFA-to-DFA Trade-Off. DCFS 2023: 79-93 - 2020
- [c9]Jozef Jirásek
Multiple Concatenation and State Complexity (Extended Abstract). DCFS 2020: 78-90
2010 – 2019
- 2018
- [c8]Jozef Jirásek
The Exact Complexity of Star-Complement-Star. CIAA 2018: 223-235 - 2016
- [j8]Jozef Jirásek
Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610: 78-90 (2016) - 2015
- [j7]Jozef Jirásek
On the boundary of regular languages. Theor. Comput. Sci. 578: 42-57 (2015) - [c7]Jozef Jirásek
The Boundary of Prefix-Free Languages. DLT 2015: 300-312 - 2014
- [c6]Jozef Jirásek
Prefix-Free Languages: Right Quotient and Reversal. DCFS 2014: 210-221 - 2013
- [c5]Jozef Jirásek, Galina Jirásková:
Cyclic Shift on Prefix-Free Languages. CSR 2013: 246-257 - [c4]Jozef Jirásek
On the Boundary of Regular Languages. CIAA 2013: 208-219
2000 – 2009
- 2009
- [j6]Peter Gurský, Tomás Horváth, Peter Vojtás, Jozef Jirásek, Stanislav Krajci, Robert Novotny, Jana Pribolová, Veronika Vaneková:
User Preference Web Search -- Experiments with a System Connecting Web and User. Comput. Informatics 28(4): 515-553 (2009) - 2008
- [j5]Jozef Jirásek
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Int. J. Found. Comput. Sci. 19(3): 617-631 (2008) - [j4]Peter Gurský, Tomás Horváth, Jozef Jirásek, Robert Novotny, Jana Pribolová, Veronika Vaneková, Peter Vojtás:
Knowledge Processing for Web Search - An Integrated Model and Experiments. Scalable Comput. Pract. Exp. 9(1) (2008) - 2007
- [c3]Jozef Jirásek
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Developments in Language Theory 2007: 254-265 - [c2]Peter Gurský, Tomás Horváth, Jozef Jirásek, Stanislav Krajci, Robert Novotny, Veronika Vaneková, Peter Vojtás:
Knowledge Processing for Web Search - An Integrated Model. IDC 2007: 96-104 - 2005
- [j3]Jozef Jirásek
State complexity of concatenation and complementation. Int. J. Found. Comput. Sci. 16(3): 511-529 (2005) - [j2]Jozef Jirásek
Arc reversal in nonhamiltonian circulant oriented graphs. J. Graph Theory 49(1): 59-68 (2005) - 2004
- [c1]Jozef Jirásek
State Complexity of Concatenation and Complementation of Regular Languages. CIAA 2004: 178-189
1990 – 1999
- 1992
- [j1]Jozef Jirásek
Some remarks on Ádám's conjecture for simple directed graphs. Discret. Math. 108(1-3): 327-332 (1992)
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 00:39 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: