東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Implementation and application of automata = 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Implementation and application of automata/ edited by Szilárd Zsolt Fazekas.
Reminder of title:	28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024 : proceedings /
remainder title:	CIAA 2024
other author:	Fazekas, Szilárd Zsolt.
corporate name:	CIAA (Conference)
Published:	Cham :Springer Nature Switzerland : : 2024.,
Description:	xxi, 364 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Invited Talks. -- Automata and Grammars for Data Words. -- Contributed Papers. -- Computing the Bandwidth of Meager Timed Automata. -- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and other Quadratic Irrationals. -- PDFA Distillation with Error Bound Guarantees. -- Constructing a BPE Tokenization DFA. -- SAT-Based Automated Completion for Reachability Analysis. -- Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals. -- On Bidirectional Deterministic Finite Automata. -- Block Languages and their Bitmap Representations. -- From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups. -- On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract) -- Global One-Counter Tree Automata. -- Decision Problems for Subregular Classes. -- State Complexity of the Minimal Star Basis. -- On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. -- Attributed Tree Transducers for Partial Functions. -- Translation of Semi-Extended Regular Expressions using Derivatives. -- Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. -- Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata. -- The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable. -- Push Complexity: Optimal Bounds and Unary Inputs. -- Decision Problems for Reversible and Permutation Automata. -- Benchmarking Regular Expression Matching. -- On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. -- Measuring Power of Commutative Group Languages.
Contained By:	Springer Nature eBook
Subject:	Machine theory - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-031-71112-1
ISBN:	9783031711121

Implementation and application of automata = 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024 : proceedings /
Implementation and application of automata28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024 : proceedings /[electronic resource] :CIAA 2024edited by Szilárd Zsolt Fazekas. - Cham :Springer Nature Switzerland :2024. - xxi, 364 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,150150302-9743 ;. - Lecture notes in computer science ;15015..

Invited Talks. -- Automata and Grammars for Data Words. -- Contributed Papers. -- Computing the Bandwidth of Meager Timed Automata. -- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and other Quadratic Irrationals. -- PDFA Distillation with Error Bound Guarantees. -- Constructing a BPE Tokenization DFA. -- SAT-Based Automated Completion for Reachability Analysis. -- Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals. -- On Bidirectional Deterministic Finite Automata. -- Block Languages and their Bitmap Representations. -- From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups. -- On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract) -- Global One-Counter Tree Automata. -- Decision Problems for Subregular Classes. -- State Complexity of the Minimal Star Basis. -- On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. -- Attributed Tree Transducers for Partial Functions. -- Translation of Semi-Extended Regular Expressions using Derivatives. -- Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. -- Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata. -- The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable. -- Push Complexity: Optimal Bounds and Unary Inputs. -- Decision Problems for Reversible and Permutation Automata. -- Benchmarking Regular Expression Matching. -- On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. -- Measuring Power of Commutative Group Languages.

This book constitutes the proceedings of the 28th International Conference on Implementation and Application of Automata, CIAA 2024, held in Akita, Japan, during September 3-6, 2024. The 24 full papers and one invited paper presented here were carefully reviewed and selected from 38 submissions. These papers have been covering various fields in the application, implementation, and theory of automata and related structures.

ISBN: 9783031711121

Standard No.: 10.1007/978-3-031-71112-1doiSubjects--Topical Terms:

546807
Machine theory
--Congresses.

LC Class. No.: QA267

Dewey Class. No.: 006.3

Implementation and application of automata = 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024 : proceedings /
LDR:03386nmm a22003615a 4500 001 2388037
003 DE-He213
005 20240903130529.0
006 m d
007 cr nn 008maaau
008 250916s2024 sz s 0 eng d
020 $a 9783031711121 $q (electronic bk.)
020 $a 9783031711114 $q (paper)
024 7 $a 10.1007/978-3-031-71112-1 $2 doi
035 $a 978-3-031-71112-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 006.3 $2 23
090 $a QA267 $b .C565 2024
111 2 $a CIAA (Conference) $n (28th : $d 2024 : $c Akita, Japan) $3 3752868
245 1 0 $a Implementation and application of automata $h [electronic resource] : $b 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024 : proceedings / $c edited by Szilárd Zsolt Fazekas.
246 3 $a CIAA 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a xxi, 364 p. : $b ill. (some col.), digital ; $c 24 cm.
347 $a text file $b PDF $2 rda
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 15015
505 0 $a Invited Talks. -- Automata and Grammars for Data Words. -- Contributed Papers. -- Computing the Bandwidth of Meager Timed Automata. -- Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and other Quadratic Irrationals. -- PDFA Distillation with Error Bound Guarantees. -- Constructing a BPE Tokenization DFA. -- SAT-Based Automated Completion for Reachability Analysis. -- Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals. -- On Bidirectional Deterministic Finite Automata. -- Block Languages and their Bitmap Representations. -- From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups. -- On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract) -- Global One-Counter Tree Automata. -- Decision Problems for Subregular Classes. -- State Complexity of the Minimal Star Basis. -- On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. -- Attributed Tree Transducers for Partial Functions. -- Translation of Semi-Extended Regular Expressions using Derivatives. -- Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. -- Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata. -- The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable. -- Push Complexity: Optimal Bounds and Unary Inputs. -- Decision Problems for Reversible and Permutation Automata. -- Benchmarking Regular Expression Matching. -- On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. -- Measuring Power of Commutative Group Languages.
520 $a This book constitutes the proceedings of the 28th International Conference on Implementation and Application of Automata, CIAA 2024, held in Akita, Japan, during September 3-6, 2024. The 24 full papers and one invited paper presented here were carefully reviewed and selected from 38 submissions. These papers have been covering 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 Computer Science Logic and Foundations of Programming. $3 3538531
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Information Storage and Retrieval. $3 761906
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
700 1 $a Fazekas, Szilárd Zsolt. $3 3752869
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 15015. $3 3752870
856 4 0 $u https://doi.org/10.1007/978-3-031-71112-1
950 $a Computer Science (SpringerNature-11645)