國立高雄大學圖資館 |

Language: English

Back

Implementation and application of au...

(1998 :)

Implementation and application of automata21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Implementation and application of automataedited by Yo-Sub Han, Kai Salomaa.
Reminder of title:	21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016 : proceedings /
remainder title:	CIAA 2016
other author:	Han, Yo-Sub.
corporate name:
Published:	Cham :Springer International Publishing :2016.
Description:	xvi, 335 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Machine theoryCongresses.
Online resource:	http://dx.doi.org/10.1007/978-3-319-40946-7
ISBN:	9783319409467$q(electronic bk.)

Implementation and application of automata21st 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] :CIAA 2016edited by Yo-Sub Han, Kai Salomaa. - Cham :Springer International Publishing :2016. - xvi, 335 p. :ill., digital ;24 cm. - Lecture notes in computer science,97050302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

442590
Machine theory
--Congresses.

LC Class. No.: QA267 / .C53 2016

Dewey Class. No.: 006.3

Implementation and application of automata21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016 : proceedings /
LDR:03340nmm a2200337 a 4500 001 492804
003 DE-He213
005 20161215155446.0
006 m d
007 cr nn 008maaau
008 170220s2016 gw s 0 eng d
020 $a 9783319409467$q(electronic bk.)
020 $a 9783319409450$q(paper)
024 7 $a 10.1007/978-3-319-40946-7 $2 doi
035 $a 978-3-319-40946-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267 $b .C53 2016
072 7 $a UYZG $2 bicssc
072 7 $a COM037000 $2 bisacsh
082 0 4 $a 006.3 $2 23
090 $a QA267 $b .C565 2016e
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
246 3 $a CIAA 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xvi, 335 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 Machine theory $v Congresses. $3 442590
650 0 $a Robotics $v Congresses. $3 387162
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Computation by Abstract Devices. $3 273703
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
700 1 $a Han, Yo-Sub. $3 753210
700 1 $a Salomaa, Kai. $3 511086
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-40946-7
950 $a Computer Science (Springer-11645)