東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Handbook of Automata Theory = Volume...

Pin, Jean-Éric,

Linked to FindBook

Google Book

Amazon

博客來

Handbook of Automata Theory = Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Handbook of Automata Theory/ Jean-Éric Pin
Reminder of title:	Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications /
other author:	Pin, Jean-Éric,
Published:	Zuerich, Switzerland :European Mathematical Society Publishing House, : 2021,
Description:	1 online resource (1608 pages)
Subject:	Mathematics and science -
Online resource:	https://doi.org/10.4171/Automata
Online resource:	https://www.ems-ph.org/img/books/Pin-Vol1_mini.jpg
ISBN:	9783985475063

Handbook of Automata Theory = Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications /
Handbook of Automata TheoryVolume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications /[electronic resource] :Jean-Éric Pin - Zuerich, Switzerland :European Mathematical Society Publishing House,2021 - 1 online resource (1608 pages)

Finite automata /Jean-Éric Pin --

Restricted to subscribers:https://www.ems-ph.org/ebooks.php

Automata 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 a 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 maxplus 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.

ISBN: 9783985475063

Standard No.: 10.4171/AutomatadoiSubjects--Topical Terms:

3481059
Mathematics and science

Handbook of Automata Theory = Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications /
LDR:05213nmm a22003015a 4500 001 2233327
003 CH-001817-3
005 20210806234503.0
006 a fot ||| 0|
007 cr nn mmmmamaa
008 210928e20210913sz fot ||| 0|eng d
020 $a 9783985475063
024 7 0 $a 10.4171/Automata $2 doi
035 $a 248-210806
040 $a ch0018173
072 7 $a P $2 bicssc
084 $a 68-xx $2 msc
245 1 0 $a Handbook of Automata Theory $h [electronic resource] : $b Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications / $c Jean-Éric Pin
260 3 $a Zuerich, Switzerland : $b European Mathematical Society Publishing House, $c 2021
300 $a 1 online resource (1608 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 0 $t Finite automata / $r Jean-Éric Pin -- $t Automata and rational expressions / $r Jacques Sakarovitch -- $t Finite transducers and rational transductions / $r Tero Harju, Juhani Karhumäki -- $t Weighted automata / $r Manfred Droste, Dietrich Kuske -- $t Max-plus automata / $r Sylvain Lombardy, Jean Mairesse -- $t ω-Automata / $r Thomas Wilke, Sven Schewe -- $t Automata on finite trees / $r Christof Löding, Wolfgang Thomas -- $t Automata on infinite trees / $r Christof Löding -- $t Two-dimensional models / $r Stefano Crespi Reghizzi, Dora Giammarresi, Violetta Lonati -- $t Minimisation of automata / $r Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot -- $t Learning algorithms / $r Henrik Björklund, Johanna Björklund, Wim Martens -- $t Descriptional complexity of regular languages / $r Hermann Gruber, Markus Holzer, Martin Kutrib -- $t Enumerating regular expressions and their languages / $r Hermann Gruber, Jonathan Lee, Jeffrey Shallit -- $t Circuit complexity of regular languages / $r Michal Koucký -- $t Černý's conjecture and the road colouring problem / $r Jarkko Kari, Mikhail V. Volkov -- $t Varieties / $r Howard Straubing, Pascal Weil -- $t Profinite topologies / $r Jorge Almeida, Alfredo Costa -- $t The factorisation forest theorem / $r Thomas Colcombet -- $t Wadge-Wagner hierarchies / $r Jacques Duparc -- $t Equational theories for automata / $r Zoltán Ésik -- $t Language equations / $r Michal Kunc, Alexander Okhotin -- $t Algebra for trees / $r Mikołaj Bojańczyk -- $t Rational subsets of groups / $r Laurent Bartholdi, Pedro Silva -- $t Groups defined by automata / $r Laurent Bartholdi, Pedro Silva -- $t Automata in number theory / $r Boris Adamczewski, Jason Bell -- $t On Cobham's theorem / $r Fabien Durand, Michel Rigo -- $t Symbolic dynamics / $r Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin -- $t Automatic structures / $r Sasha Rubin -- $t Automata and finite model theory / $r Wouter Gelade, Thomas Schwentick -- $t Finite automata, image manipulation, and automatic real functions / $r Juhani Karhumäki, Jarkko Kari -- $t Communicating automata / $r Dietrich Kuske, Anca Muscholl -- $t Symbolic methods and automata / $r Bernard Boigelot -- $t Synthesis with finite automata / $r Igor Walukiewicz -- $t Timed automata / $r Patricia Bouyer -- $t Higher-order recursion schemes and their automata models / $r Arnaud Carayol, Olivier Serre -- $t Analysis of probabilistic processes and automata theory / $r Kousha Etessami -- $t Natural language parsing / $r Mark-Jan Nederhof, Giorgio Satta -- $t Verification / $r Javier Esparza, Orna Kupferman, Moshe Y. Vardi -- $t Automata and quantum computing / $r Andris Ambainis, Abuzer Yakaryılmaz.
506 1 $a Restricted to subscribers: $u https://www.ems-ph.org/ebooks.php
520 $a Automata 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 a 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 maxplus 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.
650 0 7 $a Mathematics and science $2 bicssc $3 3481059
650 0 7 $a Computer science $3 893650
700 1 $a Pin, Jean-Éric, $e editor. $3 3481194
856 4 0 $u https://doi.org/10.4171/Automata
856 4 2 $3 cover image $u https://www.ems-ph.org/img/books/Pin-Vol1_mini.jpg