000 03217nam a22006135i 4500
001 978-3-662-52947-8
003 DE-He213
005 20240730164213.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 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
100 1 _aSkrzypczak, Michał.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982866
245 1 0 _aDescriptive Set Theoretic Methods in Automata Theory
_h[electronic resource] :
_bDecidability and Topological Complexity /
_cby Michał Skrzypczak.
250 _a1st ed. 2016.
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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 _aMachine theory.
_982867
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aSoftware engineering.
_94138
650 1 4 _aFormal Languages and Automata Theory.
_982870
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aTheory of Computation.
_982872
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aSoftware Engineering.
_94138
710 2 _aSpringerLink (Online service)
_982873
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662529461
776 0 8 _iPrinted edition:
_z9783662529485
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9802
_982874
856 4 0 _uhttps://doi.org/10.1007/978-3-662-52947-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c85418
_d85418