Search dblp for Publications

export results for "toc:db/books/collections/treeauto1992.bht:"

 download as .bib file

@incollection{DBLP:books/el/treeauto1992/AigrainN92,
  author       = {Philippe Aigrain and
                  Maurice Nivat},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Suffix, prefix and maximal tree codes},
  booktitle    = {Tree Automata and Languages},
  pages        = {21--40},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 12:47:51 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/AigrainN92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/ArnoldN92,
  author       = {Andr{\'{e}} Arnold and
                  Damian Niwinski},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Fixed point characterization of weak monadic logic definable sets
                  of trees},
  booktitle    = {Tree Automata and Languages},
  pages        = {159--188},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/ArnoldN92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/BonizzoniMPS92,
  author       = {Paola Bonizzoni and
                  Giancarlo Mauri and
                  Giovanni Pighizzini and
                  Nicoletta Sabadini},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Recognizing sets of labelled acyclic graphs},
  booktitle    = {Tree Automata and Languages},
  pages        = {201--224},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/BonizzoniMPS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Courcelle92,
  author       = {Bruno Courcelle},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Recognizable sets of unrooted trees},
  booktitle    = {Tree Automata and Languages},
  pages        = {141--158},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Courcelle92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/DauchetT92,
  author       = {Max Dauchet and
                  Sophie Tison},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Structural complexity of classes of tree languages},
  booktitle    = {Tree Automata and Languages},
  pages        = {327--354},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/DauchetT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/FulopV92,
  author       = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
                  S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Decidability of the inclusion in monoids generated by tree transformation
                  classes},
  booktitle    = {Tree Automata and Languages},
  pages        = {381--408},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/FulopV92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Gallier92,
  author       = {Jean H. Gallier},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Unification procedures in automated deduction methods based on matings:
                  {A} survey},
  booktitle    = {Tree Automata and Languages},
  pages        = {439},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Gallier92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Grosse-RhodeD92,
  author       = {Martin Gro{\ss}e{-}Rhode and
                  Christian Dimitrovici},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Algebraic specification of action trees and recursive processes},
  booktitle    = {Tree Automata and Languages},
  pages        = {235--290},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Grosse-RhodeD92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Guessarian92,
  author       = {Ir{\`{e}}ne Guessarian},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Trees and algebraic semantics},
  booktitle    = {Tree Automata and Languages},
  pages        = {291--310},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Guessarian92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/JoshiS92,
  author       = {Aravind K. Joshi and
                  Yves Schabes},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Tree-adjoining grammars and lexicalized grammars},
  booktitle    = {Tree Automata and Languages},
  pages        = {409--432},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/JoshiS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/LitovskyM92,
  author       = {Igor Litovsky and
                  Yves M{\'{e}}tivier},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Computing trees with graph rewriting systems with priorities},
  booktitle    = {Tree Automata and Languages},
  pages        = {115--140},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/LitovskyM92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Nivat92,
  author       = {Maurice Nivat},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Binary tree codes},
  booktitle    = {Tree Automata and Languages},
  pages        = {1--20},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Nivat92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Podelski92,
  author       = {Andreas Podelski},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {A monoid approach to tree automata},
  booktitle    = {Tree Automata and Languages},
  pages        = {41--56},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Podelski92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Raoult92,
  author       = {Jean{-}Claude Raoult},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {A survey of tree transductions},
  booktitle    = {Tree Automata and Languages},
  pages        = {311--326},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Raoult92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Saoudi92,
  author       = {Ahmed Saoudi},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Rational and recognizable infinite tree sets},
  booktitle    = {Tree Automata and Languages},
  pages        = {225--234},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Saoudi92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/SaoudiB92,
  author       = {Ahmed Saoudi and
                  Paola Bonizzoni},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Automata on infinite trees and rational control},
  booktitle    = {Tree Automata and Languages},
  pages        = {189--200},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/SaoudiB92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Seese92,
  author       = {Detlef Seese},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Interpretability and tree automata: {A} simple way to solve algorithmic
                  problems on graphs closely related to trees},
  booktitle    = {Tree Automata and Languages},
  pages        = {83--114},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Seese92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Seidl92,
  author       = {Helmut Seidl},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Ambiguity and valuedness},
  booktitle    = {Tree Automata and Languages},
  pages        = {355--380},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Seidl92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Simon92,
  author       = {I. Simon},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {A short proof of the factorization forest theorem},
  booktitle    = {Tree Automata and Languages},
  pages        = {433--438},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Simon92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/treeauto1992/Steinby92,
  author       = {Magnus Steinby},
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {A theory of tree language varieties},
  booktitle    = {Tree Automata and Languages},
  pages        = {57--82},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/treeauto1992/Steinby92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/el/Nivat92,
  editor       = {Maurice Nivat and
                  Andreas Podelski},
  title        = {Tree Automata and Languages},
  publisher    = {North-Holland},
  year         = {1992},
  timestamp    = {Mon, 05 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/el/Nivat92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics