000 02539nam a22004575i 4500
001 978-3-540-39505-8
003 DE-He213
005 20160624101944.0
007 cr nn 008mamaa
008 121227s1985 gw | s |||| 0|eng d
020 _a9783540395058
_9978-3-540-39505-8
024 7 _a10.1007/3-540-15641-0
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aAutomata on Infinite Words
_h[electronic resource] :
_bEcole de Printemps d'Informatique Théorique Le Mont Dore, May 14–18, 1984 /
_cedited by M. Nivat, D. Perrin.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1985.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1985.
300 _aX, 222 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v192
505 0 _aAn introduction to finite automata on infinite words -- Deterministic and non ambiguous rational ?-languages -- Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme -- 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aNivat, M.
_eeditor.
700 1 _aPerrin, D.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540156413
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v192
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-15641-0
942 _2EBK4656
_cEBK
999 _c33950
_d33950