https://iccl.inf.tu-dresden.de/w/api.php?action=feedcontributions&feedformat=atom&user=Luisa+Herrmann 2026-04-17T11:37:22Z Benutzerbeiträge MediaWiki 1.43.1 https://iccl.inf.tu-dresden.de/w/index.php?title=Article3122&diff=44283 2026-04-15T09:41:59Z

<p>Luisa Herrmann: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Johannes Osterholzer }} {{Article |Referiert=1 |Title=Non-Global Parikh Tree Automata |To appear=1 |Year=2026 |Journal=Journal of Automata, Languages and Combinatorics }} {{Publikation Details |Projekt=ScaDS.AI |Forschungsgruppe=Computational Logic }}“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Johannes Osterholzer<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Non-Global Parikh Tree Automata<br /> |To appear=1<br /> |Year=2026<br /> |Journal=Journal of Automata, Languages and Combinatorics<br /> }}<br /> {{Publikation Details<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Article3121&diff=44281 2026-04-15T09:40:07Z

<p>Luisa Herrmann: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Richard Mörbitz }} {{Article |Referiert=1 |Title=Global one-counter tree automata |To appear=0 |Year=2026 |Journal=Theoretical Computer Science |Volume=1071 |Publisher=Elsevier }} {{Publikation Details |Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Richard Mörbitz<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Global one-counter tree automata<br /> |To appear=0<br /> |Year=2026<br /> |Journal=Theoretical Computer Science<br /> |Volume=1071<br /> |Publisher=Elsevier<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the membership problem of GOCTA is in P while, in stark contrast, their emptiness problem is undecidable in general. For the special case of reversal-bounded GOCTA, we show decidability of the emptiness problem.<br /> |DOI Name=https://doi.org/10.1016/j.tcs.2026.115840<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3383&diff=40324 2024-10-18T12:05:54Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Richard Mörbitz<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Global One-Counter Tree Automata<br /> |To appear=0<br /> |Year=2024<br /> |Month=September<br /> |Booktitle=28th International Conference on Implementation and Application of Automata (CIAA 2024)<br /> |Pages=166--179<br /> |Publisher=Springer<br /> |Editor=Szilárd Zsolt Fazekas<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=15015<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem of GOCTA is undecidable while, in stark contrast, their membership problem is in P.<br /> |ISBN=978-3-031-71111-4<br /> |Link=https://arxiv.org/abs/2406.15090<br /> |DOI Name=10.1007/978-3-031-71112-1_12<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3373&diff=40323 2024-10-18T12:05:20Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Johannes Osterholzer<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Non-Global Parikh Tree Automata<br /> |To appear=0<br /> |Year=2024<br /> |Booktitle=14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)<br /> |Pages=100--117<br /> |Publisher=OPA<br /> |Editor=Florin Manea, Giovanni Pighizzini<br /> |Series=Electronic Proceedings in Theoretical Computer Science<br /> |Volume=407<br /> }}<br /> {{Publikation Details<br /> |Abstract=Parikh (tree) automata are an expressive and yet computationally well-behaved extension of finite automata – they allow to increment a number of counters during their computations, which are finally tested by a semilinear constraint. In this work, we introduce and investigate a new perspective on Parikh tree automata (PTA): instead of testing one counter configuration that results from the whole input tree, we implement a non-global automaton model. Here, we copy and distribute the current configuration at each node to all its children, incrementing the counters pathwise, and check the arith- metic constraint at each leaf. We obtain that the classes of tree languages recognizable by global PTA and non-global PTA are incomparable. In contrast to global PTA, the non-emptiness problem is undecidable for non-global PTA if we allow the automata to work with at least three counters, whereas the membership problem stays decidable. However, for a restriction of the model, where counter configurations are passed in a linear fashion to at most one child node, we can prove decidability of the non-emptiness problem.<br /> |DOI Name=10.4204/EPTCS.407.8<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3373&diff=40322 2024-10-18T12:04:55Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Johannes Osterholzer<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Non-Global Parikh Tree Automata<br /> |To appear=0<br /> |Year=2024<br /> |Booktitle=14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)<br /> |Pages=100--117<br /> |Publisher=OPA<br /> |Editor=Florin Manea, Giovanni Pighizzini<br /> |Series=Electronic Proceedings in Theoretical Computer Science<br /> |Volume=407<br /> }}<br /> {{Publikation Details<br /> |DOI Name=10.4204/EPTCS.407.8<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3383&diff=40321 2024-10-18T11:59:39Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Richard Mörbitz<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Global One-Counter Tree Automata<br /> |To appear=0<br /> |Year=2024<br /> |Month=September<br /> |Booktitle=28th International Conference on Implementation and Application of Automata (CIAA 2024)<br /> |Pages=166--179<br /> |Publisher=Springer<br /> |Editor=Fazekas, Szilárd Zsolt<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=15015<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem of GOCTA is undecidable while, in stark contrast, their membership problem is in P.<br /> |ISBN=978-3-031-71111-4<br /> |Link=https://arxiv.org/abs/2406.15090<br /> |DOI Name=10.1007/978-3-031-71112-1_12<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3383&diff=40320 2024-10-18T11:59:08Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Richard Mörbitz<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Global One-Counter Tree Automata<br /> |To appear=0<br /> |Year=2024<br /> |Month=September<br /> |Booktitle=28th International Conference on Implementation and Application of Automata (CIAA 2024)<br /> |Pages=166--179<br /> |Publisher=Springer<br /> |Editor=Fazekas, Szilárd Zsolt<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=15015<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching position. We compare the capabilities of GOCTA to those of counter tree automata and obtain that their classes of recognizable tree languages are incomparable. Moreover, we show that the emptiness problem of GOCTA is undecidable while, in stark contrast, their membership problem is in P.<br /> |ISBN=978-3-031-71111-4<br /> |Link=https://arxiv.org/abs/2406.15090<br /> |DOI Name=https://doi.org/10.1007/978-3-031-71112-1_12<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=40261 2024-10-14T09:23:59Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB/2019 and S14/717<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> I support the TCS4F initiative [[Datei:Tcs4f.png|70px|baseline|link=https://tcs4f.org]] .<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> I support the TCS4F initiative [[Datei:Tcs4f.png|70px|baseline|link=https://tcs4f.org]] .<br /> |DBLP=https://dblp.org/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=QuantLA&diff=40070 2024-09-04T07:17:40Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Projekt<br /> |Kurzname=QuantLA<br /> |Name=Quantitative Logics and Automata<br /> |Name EN=Quantitative Logics and Automata<br /> |Beschreibung DE=Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.<br /> <br /> The aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.<br /> <br /> The planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists — in addition to the weekly research seminar — of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.<br /> |Beschreibung EN=Both automata and logics are employed as modelling approaches in Computer Science, and these approaches often complement each other in a synergetic way. In Theoretical Computer Science the connection between finite automata and logics has been investigated in detail since the early nineteen sixties. This connection is highly relevant for numerous application domains. Examples are the design of combinatorial and sequential circuits, verification, controller synthesis, knowledge representation, natural language processing, or the design of XML technology. Classical logics and automata models support modelling of qualitative properties. For many Computer Science applications, however, such purely functional models are not sufficient since also quantitative phenomena need to be modelled. Examples are the vagueness and uncertainty of a statement, length of time periods, spatial information, and resource consumption. For this reason, different kinds of quantitative logics and automata models have been introduced. However, their connection is not as well-investigated as in the classical qualitative case.<br /> <br /> The aim of this research training group is to investigate quantitative logics and automata as well as their connection in a thorough and complete manner, using methods from Theoretical Computer Science. As possible applications we consider problems from verification, knowledge representation, and processing of tree-structured data.<br /> <br /> The planned qualification and supervision concept aims at providing the doctoral students with as much freedom as possible for their research work, while optimally preparing them for and supporting them in their research activities. The curriculum consists — in addition to the weekly research seminar — of Reading Groups, a Summer School in the first year of every cohort, advanced lectures, and an annual workshop. In addition, the doctoral students will participate in softskills courses offered by the participating universities.<br /> |Kontaktperson=Franz Baader<br /> |URL=http://lat.inf.tu-dresden.de/quantla/<br /> |Start=2012/10/01<br /> |Ende=2022/06/30<br /> |Finanziert von=DFG<br /> |Projektstatus=abgeschlossen<br /> |Logo=Quantla-logo-png.png<br /> |Person=Franz Baader, Manuel Bodirsky, Sebastian Rudolph, Anni-Yasmin Turhan, Shima Asaadi, Daniel Borchmann, Andreas Ecke, Sandy Seifarth, Lukas Schweizer, Simon Knäuer<br /> |Forschungsgruppe=Algebra und Diskrete Strukturen, Automatentheorie, Computational Logic, Verifikation und formale quantitative Analyse<br /> |Partner=Universität Leipzig<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Automatentheorie_und_formale_Sprachen&diff=39954 2024-07-11T14:48:50Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Forschungsgebiet<br /> |Name EN=Automata Theory and Formal Languages<br /> |Beschreibung DE=Automatentheorie befasst sich mit der Untersuchung von abstrakten Maschinen, ihren Berechnungen und Berechnungsproblemen. Im Wesentlichen können Automaten als endliche Repräsentationen von (potenziell) unendlichen formalen Sprachen verstanden werden, und sie variieren in ihrer Ausdrucksstärke je nach ihrem spezifischen Design.<br /> <br /> Endliche Automaten, die die regulären Sprachen erkennen, sind einer der grundlegendsten Formalismen in der theoretischen Informatik und haben sich in vielen Bereichen als nützliches Werkzeug erwiesen, z. B. beim Bau von Compilern, bei der formalen Verifikation oder als Mittel zum Nachweis der Entscheidbarkeit von ausdrucksstarken Logiken, die zur Wissensrepräsentation eingesetzt werden. <br /> <br /> Insbesondere in den genannten Bereichen ist es wünschenswert, Sachverhalte zu modellieren, die über Regularität hinausgehen. In diesem Forschungsprojekt sind wir an (Baum-)Automatenmodellen interessiert, die durch Zählmechanismen erweitert werden.<br /> |Beschreibung EN=Automata theory is concerned with the study of abstract machines, their computations and computational problems. In essence, automata can be understood as finite representations of (potentially) infinite formal languages, and they vary in their expressive power depending on their specific design.<br /> <br /> Finite-state automata, recognizing the regular languages, are one of the most fundamental formalisms in theoretical computer science and have proven to be a useful tool in many areas, such as compiler construction, formal verification, or as a means of proving the decidability of expressive logics applied to knowledge representation. <br /> <br /> Especially in the areas mentioned, it is desirable to model situations that go beyond regularity. In this research project, we are interested in (tree) automata models that are enriched by counting mechanisms.<br /> |Bild=CPT-FSM-abcd.svg.png<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Automatentheorie_und_formale_Sprachen&diff=39953 2024-07-11T14:48:12Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Forschungsgebiet<br /> |Name EN=Automata Theory and Formal Languages<br /> |Beschreibung DE=Automatentheorie befasst sich mit der Untersuchung von abstrakten Maschinen, ihren Berechnungen und Berechnungsproblemen. Im Wesentlichen können Automaten als endliche Repräsentationen von (potenziell) unendlichen formalen Sprachen verstanden werden, und sie variieren in ihrer Ausdrucksstärke je nach ihrem spezifischen Design.<br /> <br /> Endliche Automaten, die die regulären Sprachen erkennen, sind einer der grundlegendsten Formalismen in der theoretischen Informatik und haben sich in vielen Bereichen als nützliches Werkzeug erwiesen, z. B. beim Bau von Compilern, bei der formalen Verifikation oder als Mittel zum Nachweis der Entscheidbarkeit von ausdrucksstarken Logiken, die zur Wissensdarstellung eingesetzt werden. <br /> <br /> Insbesondere in den genannten Bereichen ist es wünschenswert, Sachverhalte zu modellieren, die über Regularität hinausgehen. In diesem Forschungsprojekt sind wir an (Baum-)Automatenmodellen interessiert, die durch Zählmechanismen erweitert werden.<br /> |Beschreibung EN=Automata theory is concerned with the study of abstract machines, their computations and computational problems. In essence, automata can be understood as finite representations of (potentially) infinite formal languages, and they vary in their expressive power depending on their specific design.<br /> <br /> Finite-state automata, recognizing the regular languages, are one of the most fundamental formalisms in theoretical computer science and have proven to be a useful tool in many areas, such as compiler construction, formal verification, or as a means of proving the decidability of expressive logics applied to knowledge representation. <br /> <br /> Especially in the areas mentioned, it is desirable to model situations that go beyond regularity. In this research project, we are interested in (tree) automata models that are enriched by counting mechanisms.<br /> |Bild=CPT-FSM-abcd.svg.png<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Automatentheorie_und_formale_Sprachen&diff=39952 2024-07-11T14:19:22Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Forschungsgebiet<br /> |Name EN=Automata Theory and Formal Languages<br /> |Beschreibung DE=Automatentheorie befasst sich mit der Untersuchung von abstrakten Maschinen, ihren Berechnungen und Berechnungsproblemen. Im Wesentlichen können Automaten als endliche Repräsentationen von (potenziell) unendlichen formalen Sprachen verstanden werden, und sie variieren in ihrer Ausdruckskraft je nach ihrem spezifischen Design.<br /> <br /> Endliche Automaten, die die regulären Sprachen erkennen, sind einer der grundlegendsten Formalismen in der theoretischen Informatik und haben sich in vielen Bereichen als nützliches Werkzeug erwiesen, z. B. beim Bau von Compilern, bei der formalen Verifikation oder als Mittel zum Nachweis der Entscheidbarkeit von ausdrucksstarken Logiken, die zur Wissensdarstellung eingesetzt werden. <br /> <br /> Insbesondere in den genannten Bereichen ist es wünschenswert, Sachverhalte zu modellieren, die über Regularität hinausgehen. In diesem Forschungsprojekt sind wir an (Baum-)Automatenmodellen interessiert, die durch Zählmechanismen erweitert werden.<br /> |Beschreibung EN=Automata theory is concerned with the study of abstract machines, their computations and computational problems. In essence, automata can be understood as finite representations of (potentially) infinite formal languages, and they vary in their expressive power depending on their specific design.<br /> <br /> Finite-state automata, recognizing the regular languages, are one of the most fundamental formalisms in theoretical computer science and have proven to be a useful tool in many areas, such as compiler construction, formal verification, or as a means of proving the decidability of expressive logics applied to knowledge representation. <br /> <br /> Especially in the areas mentioned, it is desirable to model situations that go beyond regularity. In this research project, we are interested in (tree) automata models that are enriched by counting mechanisms.<br /> |Bild=CPT-FSM-abcd.svg.png<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Phdthesis3020&diff=39946 2024-07-09T19:56:01Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> }}<br /> {{Phdthesis<br /> |Title=Weighted Automata with Storage<br /> |Instructor=Heiko Vogler, George Rahonis<br /> |Date=2020/09/29<br /> |School=Technische Universität Dresden<br /> }}<br /> {{Publikation Details<br /> |Abstract=In this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control, and (iii) by considering languages in a quantitative setting using a weight structure.<br /> |Download=Volltext (PDF).pdf<br /> |Link=https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-740685<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3314&diff=39945 2024-07-09T19:55:45Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Heiko Vogler<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=A Chomsky-Schützenberger Theorem for Weighted Automata with Storage<br /> |To appear=0<br /> |Year=2015<br /> |Booktitle=Algebraic Informatics<br /> |Pages=115-127<br /> |Publisher=Springer<br /> |Editor=Andreas Maletti<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=9270<br /> }}<br /> {{Publikation Details<br /> |Abstract=We enrich the concept of automata with storage by weights taken from any unital valuation monoid. We prove a Chomsky-Schützenberger theorem for the class of weighted languages recognizable by such weighted automata with storage.<br /> |DOI Name=https://doi.org/10.1007/978-3-319-23021-4_11<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3312&diff=39944 2024-07-09T19:55:29Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Heiko<br /> |ErsterAutorNachname=Vogler<br /> |FurtherAuthors=Manfred Droste; Luisa Herrmann<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem<br /> |To appear=0<br /> |Year=2016<br /> |Booktitle=Language and Automata Theory and Applications<br /> |Pages=127-139<br /> |Publisher=Springer<br /> |Editor=Adrian-Horia DediuJan Janoušek, Carlos Martín-Vide, Bianca Truthe<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=9618<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce a weighted MSO-logic in which one outermost existential quantification over behaviours of a storage type is allowed. As weight structures we take unital valuation monoids which include all semirings, bounded lattices, and computations of average or discounted costs. Each formula is interpreted over finite words yielding elements in the weight structure. We prove that this logic is expressively equivalent to weighted automata with storage. In particular, this implies a Büchi-Elgot-Trakhtenbrot Theorem for weighted iterated pushdown languages. For this choice of storage type, the satisfiability problem of the logic is decidable for each bounded lattice provided that its infimum is computable.<br /> |DOI Name=https://doi.org/10.1007/978-3-319-30000-9_10<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3313&diff=39943 2024-07-09T19:55:09Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Johannes<br /> |ErsterAutorNachname=Osterholzer<br /> |FurtherAuthors=Toni Dietze; Luisa Herrmann<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Linear Context-Free Tree Languages and Inverse Homomorphisms<br /> |To appear=0<br /> |Year=2016<br /> |Booktitle=Language and Automata Theory and Applications<br /> |Pages=478-489<br /> |Publisher=Springer<br /> |Editor=Adrian-Horia DediuJan Janoušek, Carlos Martín-Vide, Bianca Truthe<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=9618<br /> }}<br /> {{Publikation Details<br /> |Abstract=We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a certain linear tree homomorphism cannot be generated by any context-free tree grammar. However, the closure can be proved for the linear monadic context-free tree languages.<br /> |DOI Name=https://doi.org/10.1007/978-3-319-30000-9_37<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3311&diff=39942 2024-07-09T19:54:50Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Heiko Vogler<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Weighted Symbolic Automata with Data Storage<br /> |To appear=0<br /> |Year=2016<br /> |Booktitle=Developments in Language Theory<br /> |Pages=203-215<br /> |Publisher=Springer<br /> |Editor=Srečko Brlek, Christophe Reutenauer<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=9840<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce weighted symbolic automata with data storage, which combine and generalize the concepts of automata with storage types, weighted automata, and symbolic automata. By defining two particular data storages, we show that this combination is rich enough to capture symbolic visibly pushdown automata and weighted timed automata. We introduce a weighted MSO-logic and prove a Büchi-Elgot-Trakhtenbrot theorem, i.e., the new logic and the new automaton model are expressively equivalent.<br /> |DOI Name=https://doi.org/10.1007/978-3-662-53132-7_17<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3310&diff=39941 2024-07-09T19:54:27Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=A Medvedev Characterization of Recognizable Tree Series<br /> |To appear=0<br /> |Year=2017<br /> |Booktitle=Developments in Language Theory<br /> |Pages=210-221<br /> |Publisher=Springer<br /> |Editor=Émilie Charlier, Julien Leroy, Michel Rigo<br /> |Series=Lecture Notes in Computer Science<br /> |Volume=10396<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce representable tree series over commutative semirings, which extend representable sets to the weighted setting. We prove that restricted representable tree series are exactly those tree series that can be recognized by weighted tree automata. Moreover, we investigate the relation between unrestricted representable tree series and weighted monadic second-order logic.<br /> |DOI Name=https://doi.org/10.1007/978-3-319-62809-7_15<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Article3085&diff=39940 2024-07-09T19:54:07Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Zoltán<br /> |ErsterAutorNachname=Fülöp<br /> |FurtherAuthors=Luisa Herrmann; Heiko Vogler<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Weighted Regular Tree Grammars with Storage<br /> |To appear=0<br /> |Year=2018<br /> |Journal=Discrete Mathematics &amp; Theoretical Computer Science<br /> |Volume=20<br /> |Number=1<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a weighted tree language, which is a mapping from the set of trees to the multioperator monoid. We prove that, for multioperator monoids canonically associated to particular strong bi-monoids, the support of the generated weighted tree languages can be generated by (unweighted) regular tree grammars with storage. We characterize the class of all generated weighted tree languages by the composition of three basic concepts. Moreover, we prove results on the elimination of chain rules and of finite storage types, and we characterize weighted regular tree grammars with storage by a new weighted MSO-logic.<br /> |DOI Name=https://doi.org/10.23638/DMTCS-20-1-26<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Article3084&diff=39939 2024-07-09T19:53:45Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Johannes<br /> |ErsterAutorNachname=Osterholzer<br /> |FurtherAuthors=Toni Dietze; Luisa Herrmann<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Linear context-free tree languages and inverse homomorphisms<br /> |To appear=0<br /> |Year=2019<br /> |Journal=Information and Computation<br /> |Volume=269<br /> |Publisher=Elsevier<br /> }}<br /> {{Publikation Details<br /> |Abstract=We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. In fact, we prove a stronger result: we encode Dyck words into a linear context-free tree language and prove that its preimage under a certain linear tree homomorphism cannot be generated by any context-free tree grammar. A positive result can still be obtained: the linear monadic context-free tree languages are closed under inverse linear tree homomorphisms.<br /> |DOI Name=https://doi.org/10.1016/j.ic.2019.104454<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Article3083&diff=39938 2024-07-09T19:53:25Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Heiko Vogler; Manfred Droste<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Weighted automata with storage<br /> |To appear=0<br /> |Year=2019<br /> |Journal=Information and Computation<br /> |Volume=269<br /> |Publisher=Elsevier<br /> }}<br /> {{Publikation Details<br /> |Abstract=We consider finite-state automata that are equipped with a storage. Moreover, the transitions are weighted by elements of a unital valuation monoid. A weighted automaton with storage recognizes a weighted language, which is a mapping from input strings to elements of the carrier set of the unital valuation monoid. For the class of weighted languages recognizable by such automata we prove closure properties, a Chomsky-Schützenberger theorem, and a Büchi-Elgot-Trakhtenbrot theorem. In case of idempotent, locally finite, and sequential unital valuation monoids, the recognized weighted languages are step functions.<br /> |DOI Name=https://doi.org/10.1016/j.ic.2019.104447<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Article3082&diff=39937 2024-07-09T19:53:00Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> }}<br /> {{Article<br /> |Referiert=1<br /> |Title=Linear weighted tree automata with storage and inverse linear tree homomorphisms<br /> |To appear=0<br /> |Year=2021<br /> |Journal=Information and Computation<br /> |Volume=281<br /> |Publisher=Elsevier<br /> }}<br /> {{Publikation Details<br /> |Abstract=We introduce linear weighted tree automata with storage and show that this model generalizes linear pushdown tree automata. We prove that the class of weighted tree languages recognizable by our linear automaton model is closed under inverse linear tree homomorphisms.<br /> |ISSN=0890-5401<br /> |Link=https://www.sciencedirect.com/science/article/pii/S0890540121001462<br /> |DOI Name=https://doi.org/10.1016/j.ic.2021.104816<br /> |Projekt=QuantLA<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=39928 2024-07-08T09:38:03Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> I support the TCS4F initiative [[Datei:Tcs4f.png|70px|baseline|link=https://tcs4f.org]] .<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> I support the TCS4F initiative [[Datei:Tcs4f.png|70px|baseline|link=https://tcs4f.org]] .<br /> |DBLP=https://dblp.org/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Automatentheorie und formale Sprachen<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=News100&diff=39899 2024-07-02T06:52:32Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Neuigkeit<br /> |Titel DE=CACM-Blogartikel über die Vereinbarkeit von Familie und Beruf im akademischen Umfeld von ICCL-Forscherin Luisa Herrmann<br /> |Titel EN=CACM blog article on work-family balance in academia by ICCL researcher Luisa Herrmann<br /> |Beschreibung DE=In Folge ihre Keynote auf dem diesjährigen Logic Mentoring Workshop ([https://logic-mentoring-workshop.github.io/csl24/ LMW 2024]) wurde unsere Kollegin [[Luisa Herrmann]], Mitarbeiterin in der [[Computational Logic]] group und [https://scads.ai/ ScaDS.AI] eingeladen, ihre Überlegungen zu diesem wichtigen Thema für den Blog von [https://cacm.acm.org/ Communications of the ACM], der führenden Online- und Print-Publikation für die Bereiche Informatik und Informationstechnologie, zusammenzufassen. In unseren Augen ist die Sensibilisierung für dieses Thema von entscheidender Bedeutung in unserem Streben nach Gleichberechtigung und Familienfreundlichkeit an akademischen Einrichtungen.<br /> |Beschreibung EN=Following up on her keynote at this year's Logic Mentoring Workshop ([https://logic-mentoring-workshop.github.io/csl24/ LMW 2024]), our colleague [[Luisa Herrmann]], member of the [[Computational Logic]] group and [https://scads.ai/ ScaDS.AI] was invited to summarize her reflections on this vital subject for the blog of [https://cacm.acm.org/ Communications of the ACM], the leading online and print publication for the computing and information technology fields. We feel that raising awareness of this topic is crucial in our ongoing pursuit for gender equality and family-friendliness at academic institutions.<br /> |URL=https://cacm.acm.org/blogcacm/work-family-balance-in-academia/<br /> |Datum=2024/07/01<br /> |Bild=Familylifebalance.png<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3373&diff=39885 2024-07-01T06:50:05Z

<p>Luisa Herrmann: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Johannes Osterholzer }} {{Inproceedings |Referiert=1 |Title=Non-Global Parikh Tree Automata |To appear=1 |Year=2024 |Booktitle=14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024) }} {{Publikation Details |Projekt=ScaDS.AI |Forschungsgruppe=Computational Logic }}“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Johannes Osterholzer<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Non-Global Parikh Tree Automata<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)<br /> }}<br /> {{Publikation Details<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3383&diff=39884 2024-07-01T06:47:28Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Richard Mörbitz<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Global One-Counter Tree Automata<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=28th International Conference on Implementation and Application of Automata (CIAA 2024)<br /> }}<br /> {{Publikation Details<br /> |Link=https://arxiv.org/abs/2406.15090<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=39823 2024-06-18T09:25:08Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> I support the TCS4F initiative [[Datei:Tcs4f.png|70px|baseline|link=https://tcs4f.org]] .<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> I support the TCS4F initiative [[Datei:Tcs4f.png|70px|baseline|link=https://tcs4f.org]] .<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Tcs4f.png&diff=39822 2024-06-18T09:12:51Z

<p>Luisa Herrmann: </p> <hr /> <div></div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=39821 2024-06-18T09:03:33Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=39820 2024-06-18T08:55:56Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=39819 2024-06-18T08:54:03Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> <br /> test<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=39818 2024-06-18T08:48:45Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden and part of [https://scads.ai ScaDS.AI Dresden/Leipzig]. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3383/en&diff=39775 2024-06-12T13:07:52Z

<p>Luisa Herrmann: Page created automatically by parser function on page Inproceedings3383</p> <hr /> <div>#REDIRECT [[Inproceedings3383]]</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3383&diff=39774 2024-06-12T13:07:52Z

<p>Luisa Herrmann: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Richard Mörbitz }} {{Inproceedings |Referiert=1 |Title=Global One-Counter Tree Automata |To appear=1 |Year=2024 |Booktitle=28th International Conference on Implementation and Application of Automata (CIAA 2024) }} {{Publikation Details |Projekt=ScaDS.AI |Forschungsgruppe=Computational Logic }}“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Richard Mörbitz<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Global One-Counter Tree Automata<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=28th International Conference on Implementation and Application of Automata (CIAA 2024)<br /> }}<br /> {{Publikation Details<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39412 2024-02-29T09:57:06Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=0<br /> |Year=2024<br /> |Booktitle=CSL '24: Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic 2024<br /> |Pages=33:1-33:19<br /> |Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik<br /> |Editor=Aniello Murano, Alexandra Silva<br /> |Series=LIPIcs<br /> |Volume=288<br /> }}<br /> {{Publikation Details<br /> |Abstract=We propose ωMSO⋈BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that satisfiability of ωMSO⋈BAPA is decidable over the class of labeled infinite binary trees, whereas it becomes undecidable even for a rather mild relaxations. The decidability result is established by an elaborate multi-step transformation into a particular normal form, followed by the deployment of Parikh-Muller Tree Automata, a novel kind of automaton for infinite labeled binary trees, integrating and generalizing both Muller and Parikh automata while still exhibiting a decidable (in fact PSpace-complete) emptiness problem. By means of MSO-interpretations, we lift the decidability result to all tree-interpretable classes of structures, including the classes of finite/countable structures of bounded treewidth/cliquewidth/partitionwidth. We generalize the result further by showing that decidability is even preserved when coupling width-restricted ωMSO⋈BAPA with width-unrestricted two-variable logic with advanced counting. A final showcase demonstrates how our results can be leveraged to harvest decidability results for expressive μ-calculi extended by global Presburger constraints.<br /> |ISBN=978-3-95977-310-2<br /> |Download=Csl24 short.pdf<br /> |Slides=Msobapa final.pdf<br /> |Link=https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.33<br /> |DOI Name=10.4230/LIPIcs.CSL.2024.33<br /> |Projekt=DeciGUT, ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Msobapa_final.pdf&diff=39411 2024-02-29T09:56:56Z

<p>Luisa Herrmann: </p> <hr /> <div></div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39336 2024-01-16T15:30:06Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=CSL '24: Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic 2024<br /> }}<br /> {{Publikation Details<br /> |Abstract=We propose ωMSO⋈BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that satisfiability of ωMSO⋈BAPA is decidable over the class of labeled infinite binary trees, whereas it becomes undecidable even for a rather mild relaxations. The decidability result is established by an elaborate multi-step transformation into a particular normal form, followed by the deployment of Parikh-Muller Tree Automata, a novel kind of automaton for infinite labeled binary trees, integrating and generalizing both Muller and Parikh automata while still exhibiting a decidable (in fact PSpace-complete) emptiness problem. By means of MSO-interpretations, we lift the decidability result to all tree-interpretable classes of structures, including the classes of finite/countable structures of bounded treewidth/cliquewidth/partitionwidth. We generalize the result further by showing that decidability is even preserved when coupling width-restricted ωMSO⋈BAPA with width-unrestricted two-variable logic with advanced counting. A final showcase demonstrates how our results can be leveraged to harvest decidability results for expressive μ-calculi extended by global Presburger constraints.<br /> |Download=Csl24 short.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Csl24_short.pdf&diff=39335 2024-01-16T15:30:01Z

<p>Luisa Herrmann: </p> <hr /> <div></div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39331 2024-01-16T15:23:32Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=CSL '24: Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic 2024<br /> }}<br /> {{Publikation Details<br /> |Abstract=We propose ωMSO⋈BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that satisfiability of ωMSO⋈BAPA is decidable over the class of labeled infinite binary trees, whereas it becomes undecidable even for a rather mild relaxations. The decidability result is established by an elaborate multi-step transformation into a particular normal form, followed by the deployment of Parikh-Muller Tree Automata, a novel kind of automaton for infinite labeled binary trees, integrating and generalizing both Muller and Parikh automata while still exhibiting a decidable (in fact PSpace-complete) emptiness problem. By means of MSO-interpretations, we lift the decidability result to all tree-interpretable classes of structures, including the classes of finite/countable structures of bounded treewidth/cliquewidth/partitionwidth. We generalize the result further by showing that decidability is even preserved when coupling width-restricted ωMSO⋈BAPA with width-unrestricted two-variable logic with advanced counting. A final showcase demonstrates how our results can be leveraged to harvest decidability results for expressive μ-calculi extended by global Presburger constraints.<br /> |Download=Main.pdf<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Datei:Main.pdf&diff=39330 2024-01-16T15:23:28Z

<p>Luisa Herrmann: Luisa Herrmann lud eine neue Version von Datei:Main.pdf hoch</p> <hr /> <div></div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39329 2024-01-16T15:18:18Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=CSL '24: Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic 2024<br /> }}<br /> {{Publikation Details<br /> |Abstract=We propose ωMSO⋈BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that satisfiability of ωMSO⋈BAPA is decidable over the class of labeled infinite binary trees, whereas it becomes undecidable even for a rather mild relaxations. The decidability result is established by an elaborate multi-step transformation into a particular normal form, followed by the deployment of Parikh-Muller Tree Automata, a novel kind of automaton for infinite labeled binary trees, integrating and generalizing both Muller and Parikh automata while still exhibiting a decidable (in fact PSpace-complete) emptiness problem. By means of MSO-interpretations, we lift the decidability result to all tree-interpretable classes of structures, including the classes of finite/countable structures of bounded treewidth/cliquewidth/partitionwidth. We generalize the result further by showing that decidability is even preserved when coupling width-restricted ωMSO⋈BAPA with width-unrestricted two-variable logic with advanced counting. A final showcase demonstrates how our results can be leveraged to harvest decidability results for expressive μ-calculi extended by global Presburger constraints.<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39328 2024-01-16T15:17:19Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=CSL '24: Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic 2024<br /> }}<br /> {{Publikation Details<br /> |Projekt=ScaDS.AI<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39327 2024-01-16T14:51:17Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth; Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=Proceedings of CSL<br /> }}<br /> {{Publikation Details<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39326 2024-01-16T14:50:37Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Vincent Peth<br /> |FurtherAuthors=Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=Proceedings of CSL<br /> }}<br /> {{Publikation Details<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375/en&diff=39325 2024-01-16T14:50:02Z

<p>Luisa Herrmann: Page created automatically by parser function on page Inproceedings3375</p> <hr /> <div>#REDIRECT [[Inproceedings3375]]</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Inproceedings3375&diff=39324 2024-01-16T14:50:02Z

<p>Luisa Herrmann: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Luisa |ErsterAutorNachname=Herrmann |FurtherAuthors=Sebastian Rudolph }} {{Inproceedings |Referiert=1 |Title=Dec…“</p> <hr /> <div>{{Publikation Erster Autor<br /> |ErsterAutorVorname=Luisa<br /> |ErsterAutorNachname=Herrmann<br /> |FurtherAuthors=Sebastian Rudolph<br /> }}<br /> {{Inproceedings<br /> |Referiert=1<br /> |Title=Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures<br /> |To appear=1<br /> |Year=2024<br /> |Booktitle=Proceedings of CSL<br /> }}<br /> {{Publikation Details<br /> |Forschungsgruppe=Computational Logic<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=37018 2022-09-02T11:16:01Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Alternative URI=https://wwwtcs.inf.tu-dresden.de/~herrmann/<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=37017 2022-09-02T11:15:18Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=37016 2022-09-02T11:07:13Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programming]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann https://iccl.inf.tu-dresden.de/w/index.php?title=Luisa_Herrmann&diff=37015 2022-09-02T11:05:27Z

<p>Luisa Herrmann: </p> <hr /> <div>{{Mitarbeiter<br /> |Vorname=Luisa<br /> |Nachname=Herrmann<br /> |Akademischer Titel=Dr.<br /> |Forschungsgruppe=Computational Logic<br /> |Stellung=Wissenschaftliche Mitarbeiterin<br /> |Ehemaliger=0<br /> |Telefon=+49 351 463 42667<br /> |Email=luisa.herrmann@tu-dresden.de<br /> |Raum=APB 2019<br /> |Bild=DSC03691-7.jpg<br /> |Info EN=I am a postdoctoral researcher in the [https://iccl.inf.tu-dresden.de/web/Computational_Logic/en Computational Logic Group] at TU Dresden. Before that, I worked as a research associate at the [https://www.orchid.inf.tu-dresden.de/index.en/ Chair for Foundations of Programmingp]. During my time as a doctoral student I was a scholarship holder in the DFG Research Training Group [https://lat.inf.tu-dresden.de/quantla/ QuantLA].<br /> |DBLP=https://dblp.uni-trier.de/pid/167/6886.html<br /> |Google Scholar=https://scholar.google.com/citations?user=y0Z3rsEAAAAJ&amp;hl=en<br /> |Publikationen anzeigen=1<br /> |Abschlussarbeiten anzeigen=1<br /> }}<br /> {{Forschungsgebiet Auswahl<br /> |Forschungsgebiet=Wissensrepräsentation und logisches Schließen<br /> }}</div>

Luisa Herrmann