Implementation and Application of Automata
Editat de Sheng Yu, Andrei Paunen Limba Engleză Paperback – 15 aug 2001
Preț: 338.24 lei
Preț vechi: 422.80 lei
-20%
Puncte Express: 507
Carte tipărită la comandă
Livrare economică 24 septembrie-08 octombrie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540424918
ISBN-10: 3540424911
Pagini: 360
Ilustrații: XI, 343 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540424911
Pagini: 360
Ilustrații: XI, 343 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures.- Synthesizing State-Based Object Systems from LSC Specifications.- Applications of Finite-State Transducers in Natural Language Processing.- Technical Contributions.- Fast Implementations of Automata Computations.- Regularly Extended Two-Way Nondeterministic Tree Automata.- Glushkov Construction for Multiplicities.- Implicit Structures to Implement NFA’s from Regular Expressions.- New Finite Automaton Constructions Based on Canonical Derivatives.- Experiments with Automata Compression.- Computing Raster Images from Grid Picture Grammars.- A Basis for Looping Extensions to Discriminating-Reverse Parsing.- Automata for Pro-V Topologies.- Reachability and Safety in Queue Systems.- Generalizing the Discrete Timed Automaton.- Factorization of Ambiguous Finite-State Transducers.- MONA Implementation Secrets.- Cursors.- An Automaton Model of User-Controlled Navigation on the Web.- Direct Construction of Minimal Acyclic Subsequential Transducers.- Generic ?-Removal Algorithm for Weighted Automata.- An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages.- Unary Language Concatenation and Its State Complexity.- Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games.- State Complexity and Jacobsthal’s Function.- A Package for the Implementation of Block Codes as Finite Automata.- Regional Least-Cost Error Repair.- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata.- Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski.- The MERLin Environment Applied to ?-NFAs.- Abstracts.- Visual Exploration of Generation Algorithms for Finite Automata on the Web.- TREEBAG.- Word Random Access Compression.- Extended Sequentialization ofTransducers.- Lessons from INR in the Specification of Transductions.- Part-of-Speech Tagging with Two Sequential Transducers.- Solving Complex Problems Efficiently with Adaptive Automata.