ShopSpell

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

$41.99     $54.99   24% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  331940945X
  • ISBN-10:  331940945X
  • ISBN-13:  9783319409450
  • ISBN-13:  9783319409450
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Apr-2016
  • Pub Date:  01-Apr-2016
  • SKU:  331940945X-11-SPRI
  • SKU:  331940945X-11-SPRI
  • Pages:  335
  • Pages:  335
  • Item ID: 106062850
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 16 to Oct 18
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
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. 
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 thatlÇ