Dr. Luisa Herrmann

I am a postdoctoral researcher in the Computational Logic group at TU Dresden and part of ScaDS.AI Dresden/Leipzig. Before that, I worked as a research associate at the Chair for Foundations of Programming. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group QuantLA.

My research focuses on the field of formal languages, automata theory, and logic. I am especially interested in tree automata with counting mechanisms.

I support the TCS4F initiative: Theoretical Computer Scientists for Future

Research

For my complete list of publications see also dblp and Google Scholar.

Publications

  • Non-Global Parikh Tree Automata, with J. Osterholzer, to appear in Proceedings of NCMA 2024, 2024.
  • Global One-Counter Tree Automata, with M. Mörbitz, to appear in Proceedings of CIAA 2024, 2024. see also: arXiv:2406.15090 [cs.FL]
  • Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures, with V. Peth and S. Rudolph, Proceedings of CSL 2024, Naples, Italy, 2024. www see also: arXiv:2305.01962 [cs.LO]
  • Linear weighted tree automata with storage and inverse linear tree homomorphisms, Information and Computation, 2021.
  • Linear Context-Free Tree Languages and Inverse Homomorphisms, with J. Osterholzer and T. Dietze, Information and Computation, 2019. see also: arXiv:15010.04881 [cs.FL]
  • Weighted Automata with Storage, with H. Vogler and M. Droste, Information and Computation, 2019.
  • Weighted Regular Tree Grammars with Storage, with Z. Fülöp and H. Vogler, Discrete Mathematics & Theoretical Computer Science, 2018. see also: arXiv:1705.06681 [cs.FL]
  • A Medvedev Characterization of Recognizable Tree Series, 21th International Conference on Developments in Language Theory (DLT 2017), Liège, Belgium, August 7-11, 2017. www
  • Weighted Symbolic Automata with Data Storage, with H. Vogler, Proc. of 20th International Conference on Developments in Language Theory (DLT 2016), Montreal, Canada, July 25-28, 2016. www
  • A Weighted MSO Logic with Storage Behaviour and its Büchi-Elgot-Trakhtenbrot Theorem, with H. Vogler and M. Droste, Proc. of 10th International Conference on Language and Automata Theory and Applications (LATA 2016), Prague, Czech Republic, March 14-18, 2016. www
  • Linear Context-Free Tree Languages and Inverse Homomorphisms, with J. Osterholzer and T. Dietze, Proc. of 10th International Conference on Language and Automata Theory and Applications (LATA 2016), Prague, Czech Republic, March 14-18, 2016. www
  • A Chomsky-Schützenberger Theorem for Weighted Automata with Storage, with H. Vogler, Proc. of 6th International Conference on Algebraic Informatics (CAI 2015), Stuttgart, Deutschland, September 01 - 04, 2015. www

Theses

  • Weighted Automata with Storage. Technische Universität Dresden, Dissertation, 2020. qucosa
  • A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. Technische Universität Dresden, Master, 2015.
  • Closure of Regular Tree Languages under Application of the Inverse of YIELD. Technische Universität Dresden, Bachelor, 2013.

Awards and Scholarships

  • Doctoral scholarship. DFG Research Training Group QuantLA, TU Dresden, 2015-2020.
  • Georg-Helm-Preis. Technische Universität Dresden, 2016.
  • Lohrmann-Medaille. Technische Universität Dresden, 2016.
  • Saxonia Special Woman Award. Saxonia Systems, 2016.

Teaching

I am/was a teaching assistant in the following courses.

Contact

Office APB/2019 (2nd floor)
Andreas-Pfitzmann-Bau
Dr. rer. nat. Luisa Herrmann
Institut für Künstliche Intelligenz
Fakultät Informatik
Technische Universität Dresden
01062 Dresden, Germany
+49 (0) 351 463-42667
{given name}.{surname}@tu-dresden.de
dblp, Research Gate, and Google Scholar