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ț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 335.69 lei
Preț vechi: 419.61 lei
-20% Nou
Puncte Express: 504
Preț estimativ în valută:
64.24€ • 66.98$ • 53.39£
64.24€ • 66.98$ • 53.39£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
Preluare comenzi: 021 569.72.76
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