Publication results

• 2025

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Complementation of Emerson-Lei Automata. Proceedings of FoSSaCS'25. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2025. no. 1, p. 88-110. ISSN: 0302-9743.
  Detail | Full text in the Digital Library

• 2023

  HAVLENA, V.; ŠMAHLÍKOVÁ, B.; LENGÁL, O.; LI, Y.; TURRINI, A. Modular Mix-and-Match Complementation of Büchi Automata. In Proceedings of TACAS'23. Lecture Notes in Computer Science. Paris: Springer Verlag, 2023. no. 13993, p. 249-270. ISSN: 0302-9743.
  Detail

• 2022

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Complementing Büchi Automata with Ranker. In Proceedings of the 34th International Conference on Computer Aided Verification. Lecture Notes in Computer Science. Haifa: Springer Verlag, 2022. no. 13372, p. 188-201. ISBN: 978-3-031-13187-5. ISSN: 0302-9743.
  Detail

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation. In Proceedings of TACAS'22. Lecture Notes in Computer Science. Munich: Springer Verlag, 2022. no. 13244, p. 118-136. ISBN: 978-3-030-99526-3. ISSN: 0302-9743.
  Detail

• 2021

  ŠMAHLÍKOVÁ, B.; HAVLENA, V.; LENGÁL, O. Deciding S1S: Down the Rabbit Hole and Through the Looking Glass. In Proceedings of NETYS'21. Lecture Notes in Computer Science. Lecture notes in Computer Science. Cham: Springer Verlag, 2021. no. 12754, p. 215-222. ISSN: 0302-9743.
  Detail

*) Citations are generated once every 24 hours.