ITMS-2014+ NFP313010T634

Operačný program: 313000 - Operačný program Výskum a inovácie

Žiadateľ: Matematický ústav SAV
Identifikátor (IČO): 00166791
Názov projektu: Výskum v oblasti analýzy heterogénnych dát za účelom predikcie zmeny zdravotného stavu chronických pacientov.
Kód výzvy: OPVaI-VA/DP/2018/1.1.3-10
Celkové oprávnené výdavky projektu: 1 239 037,76 €
Požadovaná výška NFP: 1 239 037,76 €
Kód žiadosti o NFP: NFP313010T634

Zoznam publikácií

2016

  1. J. Brzozowski, G. Jirásková, B. Liu, A. Rajasekaran, M. Szykuła (2016): On the State Complexity of the Shuffle of Regular Languages. In: Câmpeanu C., Manea F., Shallit J. (eds) Descriptional Complexity of Formal Systems. DCFS 2016. Lecture Notes in Computer Science, vol 9777. Springer, Cham, pp. 73–86. doi: 10.1007/978-3-319-41114-9_6 Local copy: (pdf)
  2. M. Conder, S. Du, R. Nedela, M. Škoviera (2016): Regular maps with nilpotent automorphism group. In: Journal of Algebraic Combinatorics 44, 863–874. doi: 10.1007/s10801-016-0692-8 Local copy: (pdf)
  3. K. Hu, G. A. Jones, R. Nedela, N.-E. Wang (2016): Non-abelian almost totally branched coverings over the platonic maps. In: European Journal of Combinatorics 51, 1–11. doi: 10.1016/j.ejc.2015.04.008 Local copy: (pdf)
  4. J. Jirásek, G. Jirásková, J. Šebej (2016): Operations on Unambiguous Finite Automata. In: Brlek S., Reutenauer C. (eds) Developments in Language Theory. DLT 2016. Lecture Notes in Computer Science, vol 9840. Springer, Berlin, Heidelberg, pp. 243–255. doi: 10.1007/978-3-662-53132-7_20 Local copy: (pdf)
  5. G. Jirásková (2016): Self-Verifying Finite Automata and Descriptional Complexity. In: Câmpeanu C., Manea F., Shallit J. (eds) Descriptional Complexity of Formal Systems. DCFS 2016. Lecture Notes in Computer Science, vol 9777. Springer, Cham, pp. 29–44. doi: 10.1007/978-3-319-41114-9_3 Local copy: (pdf)
  6. G. Jirásková, A. Szabari, J. Šebej (2016): The Complexity of Languages Resulting from the Concatenation Operation. In: Câmpeanu C., Manea F., Shallit J. (eds) Descriptional Complexity of Formal Systems. DCFS 2016. Lecture Notes in Computer Science, vol 9777. Springer, Cham, pp. 153–167. doi: 10.1007/978-3-319-41114-9_12 Local copy: (pdf)
  7. G. Wimmer, J. Mačutek, G. Altmann (2016): Discrete averaged mixing applied to the logarithmic distributions. In: Mathematica Slovaca 66, no. 2, 483–492. doi: 10.1515/ms-2015-0152 Local copy: (pdf)

2017

  1. A. Dvurečenskij, M. Hyčko (2017): Hyper effect algebras. In: Fuzzy Sets and Systems Volume 326, 34–51. doi: 10.1016/j.fss.2016.12.012 Local copy: (pdf)
  2. M. Hospodár, G. Jirásková, P. Mlynárčik (2017): Nondeterministic Complexity of Operations on Free and Convex Languages. In: Carayol A., Nicaud C. (eds) Implementation and Application of Automata. CIAA 2017. Lecture Notes in Computer Science, vol 10329. Springer, Cham, pp. 138–150. doi: 10.1007/978-3-319-60134-2_12 Local copy: (pdf)
  3. M. Hospodár, G. Jirásková, P. Mlynárčik (2017): On the Descriptive Complexity of $\overline{\Sigma^*\overline{L}}$. In: Charlier É., Leroy J., Rigo M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science, vol 10396. Springer, Cham, pp. 222–234. doi: 10.1007/978-3-319-62809-7_16 Local copy: (pdf)
  4. G. Jirásková, A. Okhotin (2017): On the state complexity of operations on two-way finite automata. In: Information and Computation 253, 36–43. doi: 10.1016/j.ic.2016.12.007 Local copy: (pdf)
  5. I. Kovács, R. Nedela (2017): Confidence Region for Calibration Function Coefficients. In: J. Group Theory 20, 1135–1154. doi: 10.1515/jgth-2017-0015 Local copy: (pdf)
  6. I. Krajňáková, G. Jirásková (2017): Square on Deterministic, Alternating, and Boolean Finite Automata. In: Pighizzini G., Câmpeanu C. (eds) Descriptional Complexity of Formal Systems. DCFS 2017. Lecture Notes in Computer Science, vol 10316. Springer, Cham, pp. 214–225. doi: 10.1007/978-3-319-60252-3_17 Local copy: (pdf)

2018

  1. S. Ďuriš, Z. Ďurišová, G. Wimmer, P. Adam (2018): Overview of steps checking traceability of measurement during the process of breath analysers verification using certified reference material. In: Journal of Physics: Conference Series, 1065, Issue 8, 082009. doi: 10.1088/1742-6596/1065/8/082009 Local copy: (pdf)
  2. J. Fiala, P. Klavík, J. Kratochvíl, R. Nedela (2018): 3-connected reduction for regular graph covers. In: European Journal of Combinatorics 73, 170–210. doi: 10.1016/j.ejc.2018.06.002 Local copy: (pdf)
  3. M. Hospodár, G. Jirásková, I. Krajňáková (2018): Operations on Boolean and Alternating Finite Automata. In: Fomin F., Podolskii V. (eds) Computer Science – Theory and Applications. CSR 2018. Lecture Notes in Computer Science, vol 10846. Springer, Cham, pp. 181–193. doi: 10.1007/978-3-319-90530-3_16 Local copy: (pdf)
  4. M. Hospodár, G. Jirásková, P. Mlynárčik (2018): A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. In: Böckenhauer HJ., Komm D., Unger W. (eds) Adventures Between Lower Bounds and Higher Altitudes. Lecture Notes in Computer Science, vol 11011. Springer, Cham, pp. 17–32. doi: 10.1007/978-3-319-98355-4_2 Local copy: (pdf)
  5. J. Jirásek, G. Jirásková (2018): The Exact Complexity of Star-Complement-Star. In: Câmpeanu C. (eds) Implementation and Application of Automata. CIAA 2018. Lecture Notes in Computer Science, vol 10977. Springer, Cham, pp. 223–235. doi: 10.1007/978-3-319-94812-6_19 Local copy: (pdf)
  6. G. Jirásková, A. Okhotin (2018): State Complexity of Unambiguous Operations on Deterministic Finite Automata. In: Konstantinidis S., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2018. Lecture Notes in Computer Science, vol 10952. Springer, Cham, pp. 188–199. doi: 10.1007/978-3-319-94631-3_16 Local copy: (pdf)
  7. G. Jirásková, A. Okhotin (2018): Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. In: Hoshi M., Seki S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science, vol 11088. Springer, Cham, pp. 441–452. doi: 10.1007/978-3-319-98654-8_36 Local copy: (pdf)
  8. P. Ráboňová, G. Wimmer (2018): Confidence Region for Calibration Function Coefficients. In: Measurement Science Review 18, no. 6, 227–235. doi: 10.1515/msr-2018-0031 Local copy: (pdf)
  9. G. Wimmer, V. Witkovský (2018): Model of polynomial calibration. In: Journal of Physics: Conference Series 1065, Issue 7, 072011. doi: 10.1088/1742-6596/1065/7/072011 Local copy: (pdf)

2019

  1. S. Ďuriš, Z. Ďurišová, J. Pálenčár, P. Pavlásek, G. Wimmer, V. Witkovský (2019): Alternative Methods for Determination of Certified Value and its Uncertainty: Case Study of Using the Gravimetric Method for Preparation of Gaseous Primary Reference Material of Ethanol in Nitrogen at the Slovak Institute of Metrology. In: Measurement Techniques 62, no. 4, 312–318. doi: 10.1007/s11018-019-01623-z Local copy: (pdf)
  2. M. Hospodár, G. Jirásková, P. Mlynárčik (2019): Nondeterministic complexity in subclasses of convex languages. In: Theoretical Computer Science 787, 89–110. doi: 10.1016/j.tcs.2018.12.027 Local copy: (pdf)
  3. K. Hu, R. Nedela, N.-E. Wang (2019): Complete regular dessins of odd prime power order. In: Discrete Mathematics 342, 314–325. doi: 10.1016/j.disc.2018.09.028 Local copy: (pdf)
  4. K. Hu, R. Nedela, N.-E. Wang, K. Yuan (2019): Reciprocal skew morphisms of cyclic groups. In: Acta Math. Univ. Comenianae 88, no. 2, 305–318. url: amuc-1006 Local copy: (pdf)
  5. G. Jirásková, O. Klíma (2019): Deterministic Biautomata and Subclasses of Deterministic Linear Languages. In: Martín-Vide C., Okhotin A., Shapira D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science, vol 11417. Springer, Cham, pp. 315–327. doi: 10.1007/978-3-030-13435-8_23 Local copy: (pdf)
  6. G. Jirásková, I. Krajňáková (2019): NFA-to-DFA Trade-Off for Regular Operations. In: Hospodár M., Jirásková G., Konstantinidis S. (eds) Descriptional Complexity of Formal Systems. DCFS 2019. Lecture Notes in Computer Science, vol 11612. Springer, Cham, pp. 184–196. doi: 10.1007/978-3-030-23247-4_14 Local copy: (pdf)
  7. I. Mračka, T. Žáčik, M. Hyčko, R. Hajossy, P. Somora (2019): Optimization of gas transport - evolutionary calculations on a small cluster of computers. In: PSIG Annual Meeting, PSIG 2019, PSIG-1915. url: PSIG-1915 Local copy: (pdf)
  8. G. Wimmer, V. Witkovský (2019): On Uncertainty Analysis in the Calibration of Gauge Block: Another Look at Example S4 from EA-4/02. In: Measurement Techniques 62, no. 4, 319–326. doi: 10.1007/s11018-019-01624-y Local copy: (pdf)