Implementation and Application of Automata: 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers: Lecture Notes in Computer Science, cartea 2088
Editat de Sheng Yu, Andrei Paunen Limba Engleză Paperback – 15 aug 2001
Din seria Lecture Notes in Computer Science
- 20%
Preț: 1020.28 lei - 20%
Preț: 629.71 lei -
Preț: 395.25 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 342.61 lei - 20%
Preț: 327.36 lei - 20%
Preț: 336.86 lei - 20%
Preț: 487.46 lei - 20%
Preț: 324.19 lei - 20%
Preț: 432.78 lei - 20%
Preț: 293.24 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 850.42 lei - 20%
Preț: 328.94 lei - 20%
Preț: 573.45 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 679.09 lei - 20%
Preț: 373.16 lei - 20%
Preț: 782.57 lei - 20%
Preț: 434.17 lei - 20%
Preț: 489.11 lei - 20%
Preț: 904.16 lei - 20%
Preț: 375.72 lei - 20%
Preț: 400.17 lei - 20%
Preț: 631.96 lei - 20%
Preț: 373.80 lei - 20%
Preț: 556.96 lei - 20%
Preț: 731.97 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 15%
Preț: 558.12 lei - 20%
Preț: 400.77 lei - 20%
Preț: 488.90 lei - 20%
Preț: 340.04 lei - 20%
Preț: 403.00 lei - 20%
Preț: 327.36 lei - 20%
Preț: 330.54 lei - 20%
Preț: 568.70 lei - 20%
Preț: 563.29 lei - 20%
Preț: 315.62 lei - 20%
Preț: 355.27 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 519.32 lei
Preț: 322.93 lei
Preț vechi: 403.66 lei
-20%
Puncte Express: 484
Preț estimativ în valută:
57.11€ • 67.02$ • 49.53£
57.11€ • 67.02$ • 49.53£
Carte tipărită la comandă
Livrare economică 09-23 martie
Specificații
ISBN-13: 9783540424918
ISBN-10: 3540424911
Pagini: 364
Ilustrații: XI, 343 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540424911
Pagini: 364
Ilustrații: XI, 343 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
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.
Caracteristici
Includes supplementary material: sn.pub/extras