Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Alexander Szabari"'
Autor:
Viktor Olejár, Alexander Szabari
Publikováno v:
International Journal of Foundations of Computer Science. :1-25
A class of languages is closed under a given operation if the resulting language belongs to this class whenever the operands belong to it. We examine the closure properties of various subclasses of regular languages under basic operations of intersec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::384f0f741d201b10a2c3f3397cee7646
https://doi.org/10.1142/s0129054123450016
https://doi.org/10.1142/s0129054123450016
Publikováno v:
Theoretical Computer Science. 918:105-122
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd001825fd97283eb8b0ca5efa29adb5
https://doi.org/10.1016/j.tcs.2022.03.024
https://doi.org/10.1016/j.tcs.2022.03.024
Autor:
'Ľubomír Antoni, Erik Bruoth, Alexander Szabari, Gabriela Vozáriková, Peter Bugata, Peter Bugata Jr, Dávid Gajdoš, Dávid Hudák, Vladimíra Kmečová, Monika Staňková\\'
Publikováno v:
Computing in Cardiology Conference (CinC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bf147c627390c76514437fc628b0fbb
https://doi.org/10.22489/cinc.2022.067
https://doi.org/10.22489/cinc.2022.067
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783031132568
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d93289cd216322bc8d099e9d1863f13
https://doi.org/10.1007/978-3-031-13257-5_6
https://doi.org/10.1007/978-3-031-13257-5_6
Autor:
Lubomir Antoni, Erik Bruoth, Peter Bugata, Dávid Gajdoš, Šimon Horvát, Dávid Hudák, Vladimíra Kmečová, Richard Staňa, Monika Staňková, Alexander Szabari, Gabriela Vozáriková
Publikováno v:
Artificial Intelligence in Medicine ISBN: 9783031093418
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaf0c83255063788e39969bae63fc967
https://doi.org/10.1007/978-3-031-09342-5_42
https://doi.org/10.1007/978-3-031-09342-5_42
Autor:
Viktor Olejár, Alexander Szabari
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031135019
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89dcc9613451a19871d0a46a37e0b176
https://doi.org/10.1007/978-3-031-13502-6_9
https://doi.org/10.1007/978-3-031-13502-6_9
Autor:
L'ubomir Antoni, Erik Bruoth, Peter Bugata, David Gajdos, Simon Horvat, David Hudak, Vladimira Kmecova, Richard Stana, Monika Stankova, Alexander Szabari, Gabriela Vozarikova
Publikováno v:
2021 Computing in Cardiology (CinC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e5bf56a6472715c5a3eef6aaf64866c
https://doi.org/10.23919/cinc53138.2021.9662878
https://doi.org/10.23919/cinc53138.2021.9662878
Autor:
Ľubomír Antoni, Erik Bruoth, Peter Bugata, Peter Bugata Jr, Dávid Gajdoš, Šimon Horvát, Dávid Hudák, Vladimíra Kmečová, Richard Staňa, Monika Staňková, Alexander Szabari, Gabriela Vozáriková
Publikováno v:
Physiological Measurement. 43:064008
Objective. Within the PhysioNet/Computing in Cardiology Challenge 2021, we focused on the design of a machine learning algorithm to identify cardiac abnormalities from electrocardiogram recordings (ECGs) with a various number of leads and to assess t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58a5caa21625a7bcf89fa9ca9c096b07
https://doi.org/10.1088/1361-6579/ac69a8
https://doi.org/10.1088/1361-6579/ac69a8
Publikováno v:
Developments in Language Theory ISBN: 9783030248857
DLT
DLT
Edit distance \(\ell \)-neighborhood of a language \(\mathcal {L}\) is the set of strings that can be obtained by at most \(\ell \) elementary edit operations—deleting or inserting one symbol in the string—from some string in \(\mathcal {L}\). We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed1d20d6027fb2f0db2454929cc91e39
https://doi.org/10.1007/978-3-030-24886-4_8
https://doi.org/10.1007/978-3-030-24886-4_8
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
DCFS
We prove that for all $m,n,$ and $\alpha$ with $1 \le \alpha \le f(m,n)$, where $f(m,n)$ is the state complexity of the concatenation operation, there exist a minimal $m$-state deterministic finite automaton $A$ and a minimal $n$-state deterministic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32bcce0815b574617384f141ee9de2ac