Overview

Full Product Details

Author:   Yo-Sub Han ,  Kai Salomaa
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2016
Volume:   9705
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   5.329kg
ISBN:  

9783319409450

ISBN 10:   331940945
Pages:   335
Publication Date:   06 July 2016
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 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 ExpressionMatchers by Using Ambiguity of NFA.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions