Sebastian Maneth

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Gregor Kemper

> Home > Persons > Sebastian Maneth

Publications

2018
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/SeidlMK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/SeidlMK18
Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65(4): 21:1-21:30 (2018)
2016
[p2]
- view
  authority control:
- export record
  dblp key:
  - series/natosec/SeidlMKE16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/natosec/SeidlMKE16
Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet:
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243
2015
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/SeidlMK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/SeidlMK15
Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS 2015: 943-962
[i20]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/SeidlMK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/SeidlMK15
Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR abs/1503.09163 (2015)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.