國立虎尾科技大學 |

Implementation and Application of Automata = 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Implementation and Application of Automata/ edited by Yo-Sub Han, Kai Salomaa.
其他題名:	21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings /
其他作者:	Han, Yo-Sub.
面頁冊數:	XVI, 335 p. 91 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Computers. -
電子資源:	https://doi.org/10.1007/978-3-319-40946-7
ISBN:	9783319409467

Implementation and Application of Automata = 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings /
Implementation and Application of Automata21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings /[electronic resource] :edited by Yo-Sub Han, Kai Salomaa. - 1st ed. 2016. - XVI, 335 p. 91 illus.online resource. - Theoretical Computer Science and General Issues ;9705. - Theoretical Computer Science and General Issues ;9163.

Decision Problems for Finite Automata over Infinite Algebraic Structures -- The Degree of Irreversibility in Deterministic Finite Automata -- Deterministic Stack Transducers -- Computing the Expected Edit Distance from a String to a PFA -- Derived-Term Automata of Multitape Rational Expressions -- Solving Parity Games Using an Automata-Based Algorithm -- Ternary Equational Languages -- Problems on Finite Automata and the Exponential Time Hypothesis -- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata -- A Practical Simulation Result for Two-Way Pushdown Automata -- Nondeterministic Complexity of Operations on Closed and Ideal Languages -- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L -- Kuratowski Algebras Generated by Prefix-Free Languages -- A Logical Characterization of Small 2NFAs -- Experiments with Synchronizing Automata -- Implementation of Code Properties via Transducers -- On Synchronizing Automata and Uniform Distribution -- Looking for the Pairs that are Hard to Separate: A Quantum Approach -- Prefix Distance Between Regular Languages -- Complexity of Sets of Two-Dimensional Patterns -- The Complexity of Fixed-Height Patterned Tile Self-Assembly -- Derivative-Based Diagnosis of Regular Expression Ambiguity -- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages -- Derivatives for Enhanced Regular Expressions -- Weighted Restarting Automata as Language Acceptors -- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy -- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.

This book constitutes the refereed proceedings of the 21st International Conference on Implementation and Application of Automata, CIAA 2016, held in Seoul, South Korea, in July 2016. The 26 revised full papers presented were carefully reviewed and selected from 49 submissions. The papers cover a wide range of topics including characterizations of automata, computing distances between strings and languages, implementations of automata and experiments, enhanced regular expressions, and complexity analysis. .

ISBN: 9783319409467

Standard No.: 10.1007/978-3-319-40946-7doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Implementation and Application of Automata = 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings /
LDR:03687nam a22004095i 4500 001 973774
003 DE-He213
005 20200629185259.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319409467 $9 978-3-319-40946-7
024 7 $a 10.1007/978-3-319-40946-7 $2 doi
035 $a 978-3-319-40946-7
050 4 $a QA75.5-76.95
072 7 $a UY $2 bicssc
072 7 $a COM037000 $2 bisacsh
072 7 $a UY $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Implementation and Application of Automata $h [electronic resource] : $b 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings / $c edited by Yo-Sub Han, Kai Salomaa.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XVI, 335 p. 91 illus. $b online resource.
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
490 1 $a Theoretical Computer Science and General Issues ; $v 9705
505 0 $a Decision Problems for Finite Automata over Infinite Algebraic Structures -- The Degree of Irreversibility in Deterministic Finite Automata -- Deterministic Stack Transducers -- Computing the Expected Edit Distance from a String to a PFA -- Derived-Term Automata of Multitape Rational Expressions -- Solving Parity Games Using an Automata-Based Algorithm -- Ternary Equational Languages -- Problems on Finite Automata and the Exponential Time Hypothesis -- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata -- A Practical Simulation Result for Two-Way Pushdown Automata -- Nondeterministic Complexity of Operations on Closed and Ideal Languages -- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L -- Kuratowski Algebras Generated by Prefix-Free Languages -- A Logical Characterization of Small 2NFAs -- Experiments with Synchronizing Automata -- Implementation of Code Properties via Transducers -- On Synchronizing Automata and Uniform Distribution -- Looking for the Pairs that are Hard to Separate: A Quantum Approach -- Prefix Distance Between Regular Languages -- Complexity of Sets of Two-Dimensional Patterns -- The Complexity of Fixed-Height Patterned Tile Self-Assembly -- Derivative-Based Diagnosis of Regular Expression Ambiguity -- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages -- Derivatives for Enhanced Regular Expressions -- Weighted Restarting Automata as Language Acceptors -- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy -- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.
520 $a This book constitutes the refereed proceedings of the 21st International Conference on Implementation and Application of Automata, CIAA 2016, held in Seoul, South Korea, in July 2016. The 26 revised full papers presented were carefully reviewed and selected from 49 submissions. The papers cover a wide range of topics including characterizations of automata, computing distances between strings and languages, implementations of automata and experiments, enhanced regular expressions, and complexity analysis. .
650 0 $a Computers. $3 565115
650 0 $a Computer logic. $3 786340
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
700 1 $a Han, Yo-Sub. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1111290
700 1 $a Salomaa, Kai. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 784606
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319409450
776 0 8 $i Printed edition: $z 9783319409474
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-40946-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)