Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/dagstuhl/automata2001.bht:"
download as .bib file
@proceedings{DBLP:conf/dagstuhl/2001automata,
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36387-4},
doi = {10.1007/3-540-36387-4},
isbn = {3-540-00388-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2001automata.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Alberucci01,
author = {Luca Alberucci},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Strictness of the Modal {\(\mathrm{\mu}\)}-Calculus Hierarchy},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {185--201},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_11},
doi = {10.1007/3-540-36387-4\_11},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Alberucci01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BerwangerB01,
author = {Dietmar Berwanger and
Achim Blumensath},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {The Monadic Theory of Tree-like Structures},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {285--302},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_16},
doi = {10.1007/3-540-36387-4\_16},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BerwangerB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BerwangerB01a,
author = {Dietmar Berwanger and
Achim Blumensath},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Automata for Guarded Fixed Point Logics},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {343--355},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_19},
doi = {10.1007/3-540-36387-4\_19},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BerwangerB01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Cachat01,
author = {Thierry Cachat},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Two-Way Tree Automata Solving Pushdown Games},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {303--317},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_17},
doi = {10.1007/3-540-36387-4\_17},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Cachat01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Farwer01,
author = {Berndt Farwer},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {omega-Automata},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {3--20},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_1},
doi = {10.1007/3-540-36387-4\_1},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Farwer01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Fritz01,
author = {Carsten Fritz},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Some Fixed Point Basics},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {359--364},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_20},
doi = {10.1007/3-540-36387-4\_20},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Fritz01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Kirsten01,
author = {Daniel Kirsten},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Alternating Tree Automata and Parity Games},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {153--167},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_9},
doi = {10.1007/3-540-36387-4\_9},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Kirsten01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Klaedtke01,
author = {Felix Klaedtke},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Complementation of B{\"{u}}chi Automata Using Alternation},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {61--78},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_4},
doi = {10.1007/3-540-36387-4\_4},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Klaedtke01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Klauck01,
author = {Hartmut Klauck},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Algorithms for Parity Games},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {107--129},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_7},
doi = {10.1007/3-540-36387-4\_7},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Klauck01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Kusters01,
author = {Ralf K{\"{u}}sters},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Memoryless Determinacy of Parity Games},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {95--106},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_6},
doi = {10.1007/3-540-36387-4\_6},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Kusters01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Leucker01,
author = {Martin Leucker},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Prefix-Recognizable Graphs and Monadic Logic},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {263--284},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_15},
doi = {10.1007/3-540-36387-4\_15},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Leucker01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Mazala01,
author = {Ren{\'{e}} Mazala},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Infinite Games},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {23--42},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_2},
doi = {10.1007/3-540-36387-4\_2},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Mazala01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Niessner01,
author = {Frank Nie{\ss}ner},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Nondeterministic Tree Automata},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {135--152},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_8},
doi = {10.1007/3-540-36387-4\_8},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Niessner01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Rasch01,
author = {Thoralf R{\"{a}}sch},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Introduction to Guarded Logics},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {321--342},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_18},
doi = {10.1007/3-540-36387-4\_18},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Rasch01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Reinhardt01,
author = {Klaus Reinhardt},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {The Complexity of Translating Logic to Finite Automata},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {231--238},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_13},
doi = {10.1007/3-540-36387-4\_13},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Reinhardt01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Roggenbach01,
author = {Markus Roggenbach},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Determinization of B{\"{u}}chi-Automata},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {43--60},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_3},
doi = {10.1007/3-540-36387-4\_3},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Roggenbach01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Rohde01,
author = {Philipp Rohde},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Expressive Power of Monadic Second-Order Logic and Modal {\(\mathrm{\mu}\)}-Calculus},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {239--257},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_14},
doi = {10.1007/3-540-36387-4\_14},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Rohde01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Schwoon01,
author = {Stefan Schwoon},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Determinization and Complementation of Streett Automata},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {79--91},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_5},
doi = {10.1007/3-540-36387-4\_5},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Schwoon01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Weyer01,
author = {Mark Weyer},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Decidability of {S1S} and {S2S}},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {207--230},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_12},
doi = {10.1007/3-540-36387-4\_12},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Weyer01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Zappe01,
author = {J{\'{u}}lia Zappe},
editor = {Erich Gr{\"{a}}del and
Wolfgang Thomas and
Thomas Wilke},
title = {Modal {\(\mathrm{\mu}\)}-Calculus and Alternating Tree Automata},
booktitle = {Automata, Logics, and Infinite Games: {A} Guide to Current Research
[outcome of a Dagstuhl seminar, February 2001]},
series = {Lecture Notes in Computer Science},
volume = {2500},
pages = {171--184},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36387-4\_10},
doi = {10.1007/3-540-36387-4\_10},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Zappe01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-05-19 03:00 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
