Institut für Informatik / Fakultät für Mathematik und Informatik / Universität Leipzig
Member of the DFG Graduiertenkolleg QuantLA
Supervisor: Prof. Dr. Manfred Droste

Erik Paul


Room: A 426, Augustusplatz 10
Phone: +49-341-97/32294
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-04009 Leipzig
Germany


Lehre

Sprechzeiten: Donnerstag 15:00 - 16:00 oder nach Absprache

Wintersemester 2018/19:Diskrete Strukturen



Publications

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)]

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

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

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]