Skip to main content
SpringerLink
Log in
Book cover

Automata on Infinite Words

Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984

  • Conference proceedings
  • © 1985

Overview

Editors:
  1. M. Nivat
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. D. Perrin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 192)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (18 papers)

  1. Front Matter

    Download chapter PDF

  2. An introduction to finite automata on infinite words

    • Dominique Perrin
    Pages 1-17

  3. Deterministic and non ambiguous rational ω-languages

    • André Arnold
    Pages 18-27

  4. Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme

    • D. Beauquier
    Pages 28-46

  5. Automates boustrophedon sur des mots infinis

    • J. P Pecuchet
    Pages 47-54

  6. Star-free ω-languages and first order logic

    • J. E. Pin
    Pages 55-67

  7. A formal proof system for infinitary rational expressions

    • Ph. Darondeau, L. Kott
    Pages 68-80

  8. Logical formulas and four subclasses of ω-regular languages

    • K. Kobayashl, M. Takahashi, H. Yamasaki
    Pages 81-88

  9. Deterministic asynchronous automata

    • M. W. Shields
    Pages 89-98

  10. Alternating automata on infinite objects, determinacy and Rabin's theorem

    • David Muller, Paul E. Schupp
    Pages 99-107

  11. The solution of two star-height problems for regular trees

    • J. P. Braquelaire, B. Courcelle
    Pages 108-117

  12. Decidability of yield's equality for infinite regular trees

    • Max Dauchet, Erick Timmerman
    Pages 118-136

  13. Languages and subshifts

    • F. Blanchard, G. Hansel
    Pages 137-146

  14. The adherences of languages as topological spaces

    • Tom Head
    Pages 147-163

  15. Mots infinis en arithmetique

    • G. Rauzy
    Pages 164-171

  16. Kth power-free codes

    • Michel Leconte
    Pages 172-187

  17. On various classes of infinite words obtained by iterated mappings

    • Jean-Jacques Pansiot
    Pages 188-197

  18. Overlap free words on two symbols

    • Antonio Restivo, Sergio Salemi
    Pages 198-206

  19. Overlap-free sequences

    • Patrice Séébold
    Pages 207-215

  20. Back Matter

    Download chapter PDF
Back to top

Keywords

Bibliographic Information

  • Book Title: Automata on Infinite Words

  • Book Subtitle: Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984

  • Editors: M. Nivat, D. Perrin

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-15641-0

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1985

  • Softcover ISBN: 978-3-540-15641-3Published: 01 June 1985

  • eBook ISBN: 978-3-540-39505-8Published: 30 June 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: X, 222

  • Topics: Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation