Výpis publikací

HOLÍK, Lukáš; Ondřej LENGÁL; Juraj MAJOR; Adéla ŠTĚPKOVÁ a Jan STREJČEK. On Complementation of Nondeterministic Finite Automata Without Full Determinization. Online. In Artur Jeż, Jan Otop. Fundamentals of Computation Theory - 25th International Symposium, FCT 2025, Wrocław, Poland, September 15-17, 2025, Proceedings. Cham (Švýcarsko): Springer, 2026, s. 221-237. ISBN 978-3-032-04699-4. Dostupné z: https://doi.org/10.1007/978-3-032-04700-7_17.

SCHWARZOVÁ, Tereza; Jan STREJČEK a 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, s. 1-20. ISBN 978-3-95977-286-0. Dostupné z: https://doi.org/10.4230/LIPIcs.SAT.2023.23.

BLAHOUDEK, František; Juraj MAJOR a Jan STREJČEK. LTL to self-loop alternating automata with generic acceptance and back. Theoretical Computer Science. AMSTERDAM: North Holland, 2020, roč. 840, Nov 2020, s. 122-142. ISSN 0304-3975. Dostupné z: https://doi.org/10.1016/j.tcs.2020.07.015.

BLAHOUDEK, František; Juraj MAJOR a Jan STREJČEK. LTL to Smaller Self-Loop Alternating Automata and Back. Online. In Robert Mark Hierons, Mohamed Mosbah. Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31 - November 4, 2019, Proceedings. Cham (Switzerland): Springer, 2019, s. 152-171. ISBN 978-3-030-32504-6. Dostupné z: https://doi.org/10.1007/978-3-030-32505-3_10.

MAJOR, Juraj; František BLAHOUDEK; Jan STREJČEK; Miriama JÁNOŠOVÁ a Tatiana ZBONČÁKOVÁ. ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata. Online. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Cham (Switzerland): Springer, 2019, s. 357-365. ISBN 978-3-030-31783-6. Dostupné z: https://doi.org/10.1007/978-3-030-31784-3_21.