Institut für Informatik / Fakultät für Mathematik und Informatik / Universität Leipzig

---

Erik Paul

Room:	A 426, Augustusplatz 10
Phone:	defective
Research Group:	Automaten und Sprachen
E-mail:	epaul at informatik.uni-leipzig.de

Address

Erik Paul
Universität Leipzig
Institut für Informatik
PF 100920
D-04109 Leipzig
Germany

Lehre

Sprechzeiten: Nach Absprache

Sommersemester 2024:	• Berechenbarkeit
	• Semantik von Programmiersprachen
	• Algorithmen der syntaktischen Analyse

Thesis

The PDF of the final version of my thesis. [Persistent Link]

Publications

A. Maletti, T. Nasz, E. Paul: Weighted HOM-Problem for Nonnegative Integers, in: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Leibniz International Proceedings in Informatics, vol. 289, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2024, pp. 51:1–51:17.   [published] [preprint]

E. Paul: Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata (journal version), submitted.

E. Paul: Finite Sequentiality of Unambiguous Max-Plus Tree Automata (journal version), accepted for publication in Theory of Computing Systems, Special Issue of STACS 2019.

E. Paul: Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata, in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Leibniz International Proceedings in Informatics, vol. 168, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2020, pp. 137:1–137:15, Best Student Paper Track B.   [conference version] [full version (draft)]

E. Paul: Finite Sequentiality of Unambiguous Max-Plus Tree Automata, in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Leibniz International Proceedings in Informatics, vol. 126, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2019, pp. 53:1–53:17.   [preprint] [full version (draft)]

M. Droste, E. Paul: A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic, in: Mathematical Foundations of Computer Science (MFCS 2018), Leibniz International Proceedings in Informatics, vol. 117, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2018, pp. 76:1–76:15.   [preprint] [full version (draft)]

Y. Shang, X. Cheng, M. Droste, E. Paul: Nivat's Theorem for Turing Machines Based on Unsharp Quantum Logic, submitted.

E. Paul: Monitor Logics for Quantitative Monitor Automata, in: Mathematical Foundations of Computer Science (MFCS 2017), Leibniz International Proceedings in Informatics, vol. 83, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2017, pp. 14:1–14:13.   [preprint] [full version (draft)]

E. Paul: The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable, in: Mathematical Foundations of Computer Science (MFCS 2017), Leibniz International Proceedings in Informatics, vol. 83, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2017, pp. 53:1–53:13.   [preprint] [full version (draft)]

E. Paul: On finite and polynomial ambiguity of weighted tree automata, in: 20th International Conference on Developments in Language Theory (DLT 2016), Lecture Notes in Computer Science, vol. 9840, Springer, 2016, pp. 368–379.   [preprint]

Diploma thesis: Weighted Tree Automata and Quantitative Logics with a Focus on Ambiguity. Leipzig, 2015.   [PDF]

Talks

Weighted HOM-Problem for Nonnegative Integers, STACS 2024, 13/03/24   [slides]

Trees, Logics, and Automata – My Time in QuantLA, QuantLA Workshop 2022, 28/06/22   [slides]

Finite Sequentiality of Max-Plus Tree Automata, WATA 2021, 23/04/21   [slides]

Expressiveness and Decidability of Weighted Automata and Weighted Logics, Defense, 15/07/20   [main slides][auxiliary slides]

Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata, ICALP 2020, online/recorded video   [slides][video]

Finite Sequentiality of Unambiguous Max-Plus Tree Automata, QuantLA Workshop 2019, 08/10/19   [slides]

Finite Sequentiality of Unambiguous Max-Plus Tree Automata, STACS 2019, 15/03/19   [slides]

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic, QuantLA Seminar, 13/11/18   [slides]

Finite Sequentiality of Unambiguous Max-Plus Tree Automata, QuantLA Seminar, 30/10/18   [slides]

On Ambiguity of Max-Plus Tree Automata, 28. Theorietag Automaten und Formale Sprachen 2018, 26/09/18   [slides]

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic, MFCS 2018, 27/08/18   [slides]

Presentation of Doctoral Project, 12th Joint Workshop of the German Research Training Groups in Computer Science, Schloss Dagstuhl 2018, 28/05/18   [slides][poster]

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable, WATA 2018, 22/05/18   [slides]

Nivat's Theorem for Turing Machines Based on Unsharp Quantum Logic, QuantLA Seminar, 09/01/18   [slides]

Selected Papers of MFCS 2017, QuantLA Workshop 2017, 20/09/17   [slides]

Monitor Logics for Quantitative Monitor Automata, MFCS 2017, 22/08/17   [slides]

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable, MFCS 2017, 21/08/17   [slides]

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic, QuantLA Workshop 2016, 21/09/16   [slides]

On Finite and Polynomial Ambiguity of Weighted Tree Automata, DLT 2016, 28/07/16   [slides]

On Finite and Polynomial Ambiguity of Weighted Tree Automata, WATA 2016, 29/04/16   [slides]

On Finite and Polynomial Ambiguity of Weighted Tree Automata, QuantLA Seminar, 10/11/15   [slides]

Miscellaneous

A Layman's Understanding of Discrete Variational Autoencoders (PDF)

Notes on Diffusion Models (PDF)

Chord Construction Quiz (optimized for Mozilla)

Chord Finder (use right and left clicks)

Ortsteile Leipzig

Städte Deutschland (click + scroll to zoom / ctrl + scroll to enlarge while on map)

Soundcloud