Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Laura Kovács. Algebraic Reasoning for (Un)Solvable Loops (Invited Talk). In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 4:1-4:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kovacs:LIPIcs.MFCS.2023.4, author = {Kov\'{a}cs, Laura}, title = {{Algebraic Reasoning for (Un)Solvable Loops}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {4:1--4:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.4}, URN = {urn:nbn:de:0030-drops-185385}, doi = {10.4230/LIPIcs.MFCS.2023.4}, annote = {Keywords: Symbolic Computation, Formal Methods, Loop Analysis, Polynomial Invariants} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Sebastian Maneth and Helmut Seidl. When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 134:1-134:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{maneth_et_al:LIPIcs.ICALP.2020.134, author = {Maneth, Sebastian and Seidl, Helmut}, title = {{When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {134:1--134:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.134}, URN = {urn:nbn:de:0030-drops-125416}, doi = {10.4230/LIPIcs.ICALP.2020.134}, annote = {Keywords: Top-Down Tree Transducers, Earliest Transformation, Linear Transducers, Uniform-copying Transucers, Removal of Look-ahead, Removal of Inspection} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Michael Luttenberger, Raphaela Palenta, and Helmut Seidl. Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 48:1-48:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{luttenberger_et_al:LIPIcs.STACS.2018.48, author = {Luttenberger, Michael and Palenta, Raphaela and Seidl, Helmut}, title = {{Computing the Longest Common Prefix of a Context-free Language in Polynomial Time}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.48}, URN = {urn:nbn:de:0030-drops-84828}, doi = {10.4230/LIPIcs.STACS.2018.48}, annote = {Keywords: longest common prefix, context-free languages, combinatorics on words} }
Published in: Dagstuhl Reports, Volume 7, Issue 4 (2018)
Emmanuel Filiot, Sebastian Maneth, and Helmut Seidl. Formal Methods of Transformations (Dagstuhl Seminar 17142). In Dagstuhl Reports, Volume 7, Issue 4, pp. 23-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Article{filiot_et_al:DagRep.7.4.23, author = {Filiot, Emmanuel and Maneth, Sebastian and Seidl, Helmut}, title = {{Formal Methods of Transformations (Dagstuhl Seminar 17142)}}, pages = {23--37}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2017}, volume = {7}, number = {4}, editor = {Filiot, Emmanuel and Maneth, Sebastian and Seidl, Helmut}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.7.4.23}, URN = {urn:nbn:de:0030-drops-75462}, doi = {10.4230/DagRep.7.4.23}, annote = {Keywords: string transducers, tree transducers, expressiveness, complexity} }
Published in: Dagstuhl Reports, Volume 3, Issue 5 (2013)
Sebastian Maneth and Helmut Seidl. Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). In Dagstuhl Reports, Volume 3, Issue 5, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{maneth_et_al:DagRep.3.5.1, author = {Maneth, Sebastian and Seidl, Helmut}, title = {{Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)}}, pages = {1--18}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {5}, editor = {Maneth, Sebastian and Seidl, Helmut}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.5.1}, URN = {urn:nbn:de:0030-drops-41769}, doi = {10.4230/DagRep.3.5.1}, annote = {Keywords: tree transducers, expressiveness, complexity} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Hubert Comon, Dexter Kozen, Helmut Seidl, and Mosche Y. Vardi. Applications of Tree Automata in Rewriting, Logic and Programming (Dagstuhl Seminar 9743). Dagstuhl Seminar Report 193, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1997)
@TechReport{comon_et_al:DagSemRep.193, author = {Comon, Hubert and Kozen, Dexter and Seidl, Helmut and Vardi, Mosche Y.}, title = {{Applications of Tree Automata in Rewriting, Logic and Programming (Dagstuhl Seminar 9743)}}, pages = {1--34}, ISSN = {1619-0203}, year = {1997}, type = {Dagstuhl Seminar Report}, number = {193}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.193}, URN = {urn:nbn:de:0030-drops-150792}, doi = {10.4230/DagSemRep.193}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
André Arnold, Helmut Seidl, and Bernhard Steffen. Algorithms in Automata Theory (Dagstuhl Seminar 9406). Dagstuhl Seminar Report 81, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1994)
@TechReport{arnold_et_al:DagSemRep.81, author = {Arnold, Andr\'{e} and Seidl, Helmut and Steffen, Bernhard}, title = {{Algorithms in Automata Theory (Dagstuhl Seminar 9406)}}, pages = {1--28}, ISSN = {1619-0203}, year = {1994}, type = {Dagstuhl Seminar Report}, number = {81}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.81}, URN = {urn:nbn:de:0030-drops-149691}, doi = {10.4230/DagSemRep.81}, }
Feedback for Dagstuhl Publishing