|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Sebastian ManethPublisher: Springer Nature Switzerland AG Imprint: Springer Nature Switzerland AG Edition: 1st ed. 2021 Volume: 12803 Weight: 0.454kg ISBN: 9783030791209ISBN 10: 3030791203 Pages: 191 Publication Date: 23 June 2021 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsPolyregular 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |