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

by Yo-Sub Han (Editor), Kai Salomaa (Editor)

Overview

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.

Product Details

ISBN-13:	9783319409450
Publisher:	Springer International Publishing
Publication date:	08/13/2016
Series:	Lecture Notes in Computer Science , #9705
Edition description:	1st ed. 2016
Pages:	335
Product dimensions:	6.10(w) x 9.25(h) x (d)

Table of Contents

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 withSynchronizing 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.