Publikační výsledky

• 2025

  HAVLENA, V.; HEČKO, M.; HOLÍK, L.; LENGÁL, O. Negated String Containment is Decidable. 50th International Symposium on Mathematical Foundations of Computer Science. Leibniz International Proceedings in Informatics, LIPIcs. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2025. no. 345, p. 1-20. ISSN: 1868-8969.
  Detail

• 2024

  HAVLENA, V.; HEČKO, M.; HOLÍK, L.; LENGÁL, O.; HABERMEHL, P. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. Proceedings of CAV'24. Lecture Notes in Computer Science. Montreal: Springer Verlag, 2024. no. 14681, p. 42-67. ISSN: 0302-9743.
  Detail

*) Citace se generují jednou za 24 hodin.