Descriptive Set Theoretic Methods in Automata Theory (Record no. 55371)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02959nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-662-52947-8 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421111838.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 160805s2016 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783662529478 |
| -- | 978-3-662-52947-8 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.131 |
| 100 1# - AUTHOR NAME | |
| Author | Skrzypczak, Micha�. |
| 245 10 - TITLE STATEMENT | |
| Title | Descriptive Set Theoretic Methods in Automata Theory |
| Sub Title | Decidability and Topological Complexity / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XIII, 211 p. 18 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Subclasses of regular languages -- Thin algebras -- Extensions of regular languages. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | The 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 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-662-52947-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2016. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Software engineering. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logics and Meanings of Programs. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computation by Abstract Devices. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Software Engineering. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.