bokomslag Automata on Infinite Words
Data & IT

Automata on Infinite Words

M Nivat D Perrin

Pocket

769:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-15 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 222 sidor
  • 1985
An introduction to finite automata on infinite words.- Deterministic and non ambiguous rational ?-languages.- Ensembles reconnaissables de mots bi-inpinis Limite et drminisme.- Automates boustrophedon sur des mots infinis.- Star-free ?-languages and first order logic.- A formal proof system for infinitary rational expressions.- Logical formulas and four subclasses of ?-regular languages.- Deterministic asynchronous automata.- Alternating automata on infinite objects, determinacy and Rabin's theorem.- The solution of two star-height problems for regular trees.- Decidability of yield's equality for infinite regular trees.- Languages and subshifts.- The adherences of languages as topological spaces.- Mots infinis en arithmetique.- Kth power-free codes.- On various classes of infinite words obtained by iterated mappings.- Overlap free words on two symbols.- Overlap-free sequences.

  • Författare: M Nivat, D Perrin
  • Format: Pocket/Paperback
  • ISBN: 9783540156413
  • Språk: Engelska
  • Antal sidor: 222
  • Utgivningsdatum: 1985-06-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K