Publication Records

JANKOLA, Marek and Jan STREJČEK. Tighter Construction of Tight Büchi Automata. Online. In Naoki Kobayashi and James Worrell. Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Cham: Springer, 2024, p. 234-255. ISBN 978-3-031-57227-2. Available from: https://dx.doi.org/10.1007/978-3-031-57228-9_12.

SCHWARZOVÁ, Tereza, Jan STREJČEK and Juraj MAJOR. Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. Online. In Meena Mahajan and Friedrich Slivovsky. 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 1-20. ISBN 978-3-95977-286-0. Available from: https://dx.doi.org/10.4230/LIPIcs.SAT.2023.23.

BLUMENSATH, Achim. The Power-Set Construction for Tree Algebras. LOGICAL METHODS IN COMPUTER SCIENCE. GERMANY: LOGICAL METHODS COMPUTER SCIENCE E V, 2023, vol. 19, No 4, p. 1-47. ISSN 1860-5974. Available from: https://dx.doi.org/10.46298/lmcs-19(4:9)2023.

BLUMENSATH, Achim. Algebraic Language Theory for Eilenberg–Moore Algebras. Logical Methods in Computer Science. Logical Methods in Computer Science e.V., 2021, vol. 17, No 2, p. 1-60. ISSN 1860-5974. Available from: https://dx.doi.org/10.23638/LMCS-17(2:6)2021.

SÍČ, Juraj and Jan STREJČEK. DQBDD: An Efficient BDD-Based DQBF Solver. Online. In Chu-Min Li and Felip Manyà. Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Cham (Switzerland): Springer, 2021, p. 535-544. ISBN 978-3-030-80222-6. Available from: https://dx.doi.org/10.1007/978-3-030-80223-3_36.

BLUMENSATH, Achim and Jakub LÉDL. ω-Forest Algebras and Temporal Logics. Online. In Filippo Bonchi, Simon J. Puglisi. 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 1-21. ISBN 978-3-95977-201-3. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.19.

BLUMENSATH, Achim and Felix WOLF. Bisimulation invariant monadic-second order logic in the finite. Theoretical Computer Science. Elsevier, 2020, vol. 823, No 1, p. 26-43. ISSN 0304-3975. Available from: https://dx.doi.org/10.1016/j.tcs.2020.03.001.

BLUMENSATH, Achim. Regular Tree Algebras. Logical Methods in Computer Science. Technical University of Braunschweig, 2020, vol. 16, No 1, p. 1-25. ISSN 1860-5974. Available from: https://dx.doi.org/10.23638/LMCS-16(1:16)2020.

BLUMENSATH, Achim and Felix WOLF. Bisimulation Invariant Monadic-Second Order Logic in the Finite. Online. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Dagstuhl: Schloss Dagstuhl, 2018, p. 1-13. ISBN 978-3-95977-076-7. Available from: https://dx.doi.org/10.4230/LIPIcs.ICALP.2018.117.

BLUMENSATH, Achim, Thomas COLCOMBET and Pawel PARYS. On a Fragment of AMSO and Tiling Systems. Online. In Nicolas Ollinger, Heribert Vollmer. 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orleans, France. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 1-14. ISBN 978-3-95977-001-9. Available from: https://dx.doi.org/10.4230/LIPIcs.STACS.2016.19.