default search action
Search dblp for Publications
export results for "toc:db/conf/litp/litp1984.bht:"
@proceedings{DBLP:conf/litp/1984, editor = {Maurice Nivat and Dominique Perrin}, title = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/3-540-15641-0}, doi = {10.1007/3-540-15641-0}, isbn = {3-540-15641-0}, timestamp = {Fri, 17 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/1984.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Arnold84, author = {Andr{\'{e}} Arnold}, editor = {Maurice Nivat and Dominique Perrin}, title = {Deterministic and non ambiguous rational omega-languages}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {18--27}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_20}, doi = {10.1007/3-540-15641-0\_20}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/litp/Arnold84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Beauquier84, author = {Dani{\`{e}}le Beauquier}, editor = {Maurice Nivat and Dominique Perrin}, title = {Ensembles reconnaissables de mots bi -infinis limite et d{\'{e}}terminisme}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {28--46}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_21}, doi = {10.1007/3-540-15641-0\_21}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Beauquier84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/BlanchardH84, author = {Fran{\c{c}}ois Blanchard and Georges Hansel}, editor = {Maurice Nivat and Dominique Perrin}, title = {Languages and subshifts}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {138--146}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_30}, doi = {10.1007/3-540-15641-0\_30}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/BlanchardH84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/BraquelaireC84, author = {Jean{-}Pierre Braquelaire and Bruno Courcelle}, editor = {Maurice Nivat and Dominique Perrin}, title = {The solution of two star height problems for regular trees}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {108--117}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_28}, doi = {10.1007/3-540-15641-0\_28}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/BraquelaireC84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/DarondeauK84, author = {Philippe Darondeau and Laurent Kott}, editor = {Maurice Nivat and Dominique Perrin}, title = {A formal proof system for infinitary rational expressions}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {68--80}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_24}, doi = {10.1007/3-540-15641-0\_24}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/DarondeauK84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/DauchetT84, author = {Max Dauchet and Erick Timmerman}, editor = {Maurice Nivat and Dominique Perrin}, title = {Decidability of yield's equality for infinite regular trees}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {118--136}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_29}, doi = {10.1007/3-540-15641-0\_29}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/DauchetT84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Head84, author = {Tom Head}, editor = {Maurice Nivat and Dominique Perrin}, title = {The adherences of languages as topological spaces}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {147--163}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_31}, doi = {10.1007/3-540-15641-0\_31}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Head84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/KobayashiTY84, author = {Kojiro Kobayashi and Masako Takahashi and Hideki Yamasaki}, editor = {Maurice Nivat and Dominique Perrin}, title = {Logical formulas and four subclasses of omega-regular languages}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {81--88}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_25}, doi = {10.1007/3-540-15641-0\_25}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/KobayashiTY84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Leconte84, author = {Michel Leconte}, editor = {Maurice Nivat and Dominique Perrin}, title = {K-th power free codes}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {172--187}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_33}, doi = {10.1007/3-540-15641-0\_33}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Leconte84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/MullerS84, author = {David E. Muller and Paul E. Schupp}, editor = {Maurice Nivat and Dominique Perrin}, title = {Alternating automata on infinite objects, determinacy and Rabin's theorem}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {100--107}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_27}, doi = {10.1007/3-540-15641-0\_27}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/MullerS84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Pansiot84, author = {Jean{-}Jacques Pansiot}, editor = {Maurice Nivat and Dominique Perrin}, title = {On various classes of infinite words obtained by iterated mappings}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {188--197}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_34}, doi = {10.1007/3-540-15641-0\_34}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Pansiot84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Pecuchet84, author = {Jean{-}Pierre P{\'{e}}cuchet}, editor = {Maurice Nivat and Dominique Perrin}, title = {Automates boustroph{\'{e}}don sur des mots infinis}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {47--54}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_22}, doi = {10.1007/3-540-15641-0\_22}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Pecuchet84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Perrin84, author = {Dominique Perrin}, editor = {Maurice Nivat and Dominique Perrin}, title = {An introduction to finite automata on infinite words}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {2--17}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_19}, doi = {10.1007/3-540-15641-0\_19}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Perrin84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Pin84, author = {Jean{-}Eric Pin}, editor = {Maurice Nivat and Dominique Perrin}, title = {Star free omega-languages and first order logic}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {56--67}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_23}, doi = {10.1007/3-540-15641-0\_23}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Pin84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Rauzy84, author = {G. Rauzy}, editor = {Maurice Nivat and Dominique Perrin}, title = {Mots infinis en arithm{\'{e}}tique}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {165--171}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_32}, doi = {10.1007/3-540-15641-0\_32}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Rauzy84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/RestivoS84, author = {Antonio Restivo and Sergio Salemi}, editor = {Maurice Nivat and Dominique Perrin}, title = {Overlap-free words on two symbols}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {198--206}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_35}, doi = {10.1007/3-540-15641-0\_35}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/RestivoS84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Seebold84, author = {Patrice S{\'{e}}{\'{e}}bold}, editor = {Maurice Nivat and Dominique Perrin}, title = {Overlap-free sequences}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {207--215}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_36}, doi = {10.1007/3-540-15641-0\_36}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Seebold84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/litp/Shields84, author = {M. W. Shields}, editor = {Maurice Nivat and Dominique Perrin}, title = {Deterministic asynchronous automata}, booktitle = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique, Le Mont Dore, France, May 14-18, 1984}, series = {Lecture Notes in Computer Science}, volume = {192}, pages = {89--98}, publisher = {Springer}, year = {1984}, url = {https://doi.org/10.1007/3-540-15641-0\_26}, doi = {10.1007/3-540-15641-0\_26}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/litp/Shields84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.