000 02959nam a22005895i 4500
001 978-3-662-52947-8
003 DE-He213
005 20200421111838.0
007 cr nn 008mamaa
008 160805s2016 gw | s |||| 0|eng d
020 _a9783662529478
_9978-3-662-52947-8
024 7 _a10.1007/978-3-662-52947-8
_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
100 1 _aSkrzypczak, Micha�.
_eauthor.
245 1 0 _aDescriptive Set Theoretic Methods in Automata Theory
_h[electronic resource] :
_bDecidability and Topological Complexity /
_cby Micha� Skrzypczak.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aXIII, 211 p. 18 illus.
_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 ;
_v9802
505 0 _aSubclasses of regular languages -- Thin algebras -- Extensions of regular languages.
520 _aThe book is based on the PhD thesis "Descriptive Set Theoretic Methods in Automata Theory," awarded the E.W. Beth Prize in 2015 for outstanding dissertations in the fields of logic, language, and information. The thesis reveals unexpected connections between advanced concepts in logic, descriptive set theory, topology, and automata theory and provides many deep insights into the interplay between these fields. It opens new perspectives on central problems in the theory of automata on infinite words and trees and offers very impressive advances in this theory from the point of view of topology. "...the thesis of Micha� Skrzypczak offers certainly what we expect from excellent mathematics: new unexpected connections between a priori distinct concepts, and proofs involving enlightening ideas." Thomas Colcombet.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSoftware Engineering.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662529461
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9802
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-662-52947-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c55371
_d55371