Implementation and Application of Automata: 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings

By Ruth J. Williams and Kai Lai Chung

Book Overview

Polyregular Functions.- Back to the Future: A Fresh Look at Linear Temporal Logic.- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.- Memoized Regular Expressions.- The Commutative Closure of Shuffle Languages over Group Languages is Regular.- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis.- Degrees of Restriction for Two-Dimensional Automata.- The Range of State Complexities of Languages Resulting from the Cascade Product-The Unary Case (Extended Abstract) .- Guessing the Buffer Bound for k-Synchronizability.- The Commutative Closure of Shuffle Languages over Group Languages is Regular.- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers.- Ambiguity Hierarchies for Weighted Tree Automata.- Boolean Kernels of Context-Free Languages.- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton.- Approximate Hashing for Bioinformatics.

• Format: Paperback
• Language: English
• ISBN: 1461288371
• ISBN13: 9781461288374
• Release Date: September 2011
• Publisher: Birkhauser
• Length: 278 Pages
• Weight: 0.93 lbs.
• Dimensions: 0.6" x 6.1" x 9.2"