default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Hospodár
Person information
- affiliation: Slovak Academy of Sciences, Mathematical Institute, Košice, Slovakia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Michal Hospodár
, Viktor Olejár, Juraj Sebej:
Decision Problems for Subregular Classes. CIAA 2024: 180-194- 2023
- [j8]Michal Hospodár, Viktor Olejár:
The cut operation in subclasses of convex languages. Theor. Comput. Sci. 969: 114050 (2023) - [j7]Michal Hospodár, Viktor Olejár:
Nondeterministic operational complexity in subregular languages. Theor. Comput. Sci. 972: 114075 (2023) - [c15]Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej:
Operational Complexity: NFA-to-DFA Trade-Off. DCFS 2023: 79-93 - [c14]Michal Hospodár, Galina Jirásková:
Operational Complexity in Subregular Classes. CIAA 2023: 153-165 - 2022
- [c13]Michal Hospodár, Peter Mlynárcik, Viktor Olejár:
Operations on Subregular Languages and Nondeterministic State Complexity. DCFS 2022: 112-126 - [c12]Michal Hospodár, Viktor Olejár:
The Cut Operation in Subclasses of Convex Languages (Extended Abstract). CIAA 2022: 152-164 - 2021
- [j6]Michal Hospodár:
Power, positive closure, and quotients on convex languages. Theor. Comput. Sci. 870: 53-74 (2021) - 2020
- [j5]Michal Hospodár, Markus Holzer:
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. Int. J. Found. Comput. Sci. 31(8): 1159-1177 (2020) - [j4]Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Preface. J. Autom. Lang. Comb. 25(2-3): 81-82 (2020) - [c11]Michal Hospodár, Peter Mlynárcik:
Operations on Permutation Automata. DLT 2020: 122-136
2010 – 2019
- 2019
- [j3]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Descriptional Complexity of the Forever Operator. Int. J. Found. Comput. Sci. 30(1): 115-134 (2019) - [j2]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic complexity in subclasses of convex languages. Theor. Comput. Sci. 787: 89-110 (2019) - [c10]Sylvie Davies, Michal Hospodár:
Square, Power, Positive Closure, and Complementation on Star-Free Languages. DCFS 2019: 98-110 - [c9]Markus Holzer, Michal Hospodár:
The Range of State Complexities of Languages Resulting from the Cut Operation. LATA 2019: 190-202 - [c8]Michal Hospodár:
Descriptional Complexity of Power and Positive Closure on Convex Languages. CIAA 2019: 158-170 - [e3]Michal Hospodár, Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings. Lecture Notes in Computer Science 11612, Springer 2019, ISBN 978-3-030-23246-7 [contents] - [e2]Michal Hospodár, Galina Jirásková:
Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings. Lecture Notes in Computer Science 11601, Springer 2019, ISBN 978-3-030-23678-6 [contents] - 2018
- [j1]Michal Hospodár, Galina Jirásková:
The complexity of concatenation on deterministic and alternating finite automata. RAIRO Theor. Informatics Appl. 52(2-3-4): 153-168 (2018) - [c7]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. Adventures Between Lower Bounds and Higher Altitudes 2018: 17-32 - [c6]Michal Hospodár, Galina Jirásková, Ivana Krajnáková:
Operations on Boolean and Alternating Finite Automata. CSR 2018: 181-193 - [c5]Michal Hospodár, Markus Holzer:
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. CIAA 2018: 198-210 - [e1]Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Österreichische Computer Gesellschaft 2018, ISBN 978-3-903035-21-8 [contents] - 2017
- [c4]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$. DLT 2017: 222-234 - [c3]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic Complexity of Operations on Free and Convex Languages. CIAA 2017: 138-150 - 2016
- [c2]Michal Hospodár, Galina Jirásková:
Concatenation on deterministic and alternating automata. NCMA 2016: 179-194 - [c1]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic Complexity of Operations on Closed and Ideal Languages. CIAA 2016: 125-137
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-10-04 21:00 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:
