000 a
999 _c33175
_d33175
008 240429b xxu||||| |||| 00| 0 eng d
020 _a9783985470068, 9783985470037
_chbk
082 _a510
_bPIN
100 _aPin, Jean-Éric
_eed.
245 _aHandbook of Automata Theory : Volumes I (Theoretical Foundations) and II (Automata in Mathematics and Selected Applications)
260 _bEMS Press,
_c2021
_aGermany :
300 _avol. 1 xxii,838 p. ;, vol. 2 xxii,1493 p. ;
_bill.,
_c24 cm
365 _b199.00
_c$
_d86.30
504 _aIncludes indexes.
520 _aAutomata theory is a subject of study at the crossroads of mathematics, theoretical computer science, and applications. In its core it deals with abstract models of systems whose behaviour is based on transitions between states, and it develops methods for the description, classification, analysis, and design of such systems. The Handbook of Automata Theory gives a comprehensive overview of current research in automata theory, and is aimed at broad readership of researchers and graduate students in mathematics and computer science. Volume I is divided into three parts. The first part presents various types of automata: automata on words, on infinite words, on finite and infinite trees, weighted and max-plus automata, transducers, and two-dimensional models. Complexity aspects are discussed in the second part. Algebraic and topological aspects of automata theory are covered in the third part. Volume II consists of two parts. The first part is dedicated to applications of automata in mathematics: group theory, number theory, symbolic dynamics, logic, and real functions. The second part presents a series of further applications of automata theory such as message-passing systems, symbolic methods, synthesis, timed automata, verification of higher-order programs, analysis of probabilistic processes, natural language processing, formal verification of programs and quantum computing. The two volumes comprise a total of thirty-nine chapters, with extensive references and individual tables of contents for each one, as well as a detailed subject index--Back cover.
650 _aJean Eric Pin
650 _aQuantum computing
650 _aProgram verification
650 _aNatural language processing
650 _aProbabilistic processes
650 _aTimed automata
650 _aSymbolic methods
650 _aMessage-passing systems
650 _aReal function
650 _aSymbolic dynamics
650 _aNumber theory
650 _aGroup theory
942 _2ddc
_cBK