東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Implementation and application of au...

CIAA (Conference) (2021 :)

FindBook

Google Book

Amazon

博客來

Implementation and application of automata = 25th International Conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Implementation and application of automata/ edited by Sebastian Maneth.
其他題名:	25th International Conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings /
其他題名:	CIAA 2021
其他作者:	Maneth, Sebastian.
團體作者:	CIAA (Conference)
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xiii, 191 p. :ill. (some col.), digital ;24 cm.
內容註:	Polyregular Functions -- Back to the Future: A Fresh Look at Linear Temporal Logic -- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages -- Memoized Regular Expressions -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis -- Degrees of Restriction for Two-Dimensional Automata -- The Range of State Complexities of Languages Resulting from the Cascade Product-The Unary Case (Extended Abstract) -- Guessing the Buffer Bound for k-Synchronizability -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers -- Ambiguity Hierarchies for Weighted Tree Automata -- Boolean Kernels of Context-Free Languages -- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton -- Approximate Hashing for Bioinformatics.
Contained By:	Springer Nature eBook
標題:	Machine theory - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-79121-6
ISBN:	9783030791216

Implementation and application of automata = 25th International Conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings /
Implementation and application of automata25th International Conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings /[electronic resource] :CIAA 2021edited by Sebastian Maneth. - Cham :Springer International Publishing :2021. - xiii, 191 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,128030302-9743 ;. - Lecture notes in computer science ;12803..

Polyregular Functions -- Back to the Future: A Fresh Look at Linear Temporal Logic -- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages -- Memoized Regular Expressions -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis -- Degrees of Restriction for Two-Dimensional Automata -- The Range of State Complexities of Languages Resulting from the Cascade Product-The Unary Case (Extended Abstract) -- Guessing the Buffer Bound for k-Synchronizability -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers -- Ambiguity Hierarchies for Weighted Tree Automata -- Boolean Kernels of Context-Free Languages -- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton -- Approximate Hashing for Bioinformatics.

This book constitutes the proceedings of the 25th International Conference on Implementation and Application of Automata, CIAA 2021, held in July 2021. Due to Covid-19 pandemic the conference was held virtually. The 13 regular papers presented in this book were carefully reviewed and selected from 20 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.

ISBN: 9783030791216

Standard No.: 10.1007/978-3-030-79121-6doiSubjects--Topical Terms:

546807
Machine theory
--Congresses.

LC Class. No.: QA267 / .C53 2021

Dewey Class. No.: 006.3

Implementation and application of automata = 25th International Conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings /
LDR:02799nmm a2200373 a 4500 001 2244386
003 DE-He213
005 20210626211250.0
006 m d
007 cr nn 008maaau
008 211207s2021 sz s 0 eng d
020 $a 9783030791216 $q (electronic bk.)
020 $a 9783030791209 $q (paper)
024 7 $a 10.1007/978-3-030-79121-6 $2 doi
035 $a 978-3-030-79121-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267 $b .C53 2021
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 006.3 $2 23
090 $a QA267 $b .C565 2021
111 2 $a CIAA (Conference) $n (25th : $d 2021 : $c Online) $3 3505213
245 1 0 $a Implementation and application of automata $h [electronic resource] : $b 25th International Conference, CIAA 2021, virtual event, July 19-22, 2021 : proceedings / $c edited by Sebastian Maneth.
246 3 $a CIAA 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xiii, 191 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12803
490 1 $a Theoretical computer science and general issues
505 0 $a Polyregular Functions -- Back to the Future: A Fresh Look at Linear Temporal Logic -- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages -- Memoized Regular Expressions -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis -- Degrees of Restriction for Two-Dimensional Automata -- The Range of State Complexities of Languages Resulting from the Cascade Product-The Unary Case (Extended Abstract) -- Guessing the Buffer Bound for k-Synchronizability -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers -- Ambiguity Hierarchies for Weighted Tree Automata -- Boolean Kernels of Context-Free Languages -- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton -- Approximate Hashing for Bioinformatics.
520 $a This book constitutes the proceedings of the 25th International Conference on Implementation and Application of Automata, CIAA 2021, held in July 2021. Due to Covid-19 pandemic the conference was held virtually. The 13 regular papers presented in this book were carefully reviewed and selected from 20 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.
650 0 $a Machine theory $v Congresses. $3 546807
650 0 $a Robotics $x Congresses. $3 649569
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Information Systems and Communication Service. $3 891044
650 2 4 $a Logic in AI. $3 3386372
700 1 $a Maneth, Sebastian. $3 2156437
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12803. $3 3505214
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-79121-6
950 $a Computer Science (SpringerNature-11645)