Cantitate/Preț
Produs

Automata Implementation: Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers: Lecture Notes in Computer Science, cartea 1436

Editat de Derick Wood, Sheng Yu
en Limba Engleză Paperback – 24 iun 1998
This book constitutes the thoroughly refereed revised post-workshop proceedings of the Second International Workshop on Implementing Automata, WIA'97, held in London, Ontario, Canada, in September 1997.
The book presents 21 revised full papers carefully reviewed and selected for inclusion in the book; also included is an introductory overview. The papers discuss issues involved in the implementation of automata of all types also covering aspects from areas such as natural language processing, pattern matching, speaker recognition, VLSI testing, etc. This book reflects the state-of-the-art in this emerging area of interdisciplinary research.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31350 lei

Preț vechi: 39187 lei
-20% Nou

Puncte Express: 470

Preț estimativ în valută:
6001 6452$ 5003£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540646945
ISBN-10: 3540646949
Pagini: 268
Ilustrații: IX, 259 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

WIA and theory and practice.- Construction of efficient generalized LR parsers.- Visualization of dynamic automata using Padnon.- Automata of asynchronous behaviors.- LANGAGE: A Maple package for automaton characterization of regular languages.- In vitro implementation of finite-state machines.- Implementing WS1S via finite automata: Performance issues.- Multi-tape automata for speech and language systems: A prolog implementation.- Tools to implement automata, a first step: ASTL.- Minimal separating sets for Muller automata.- Pseudo-minimal transducers: A transducer with proper elements.- Towards a meta-normal form algorithm for context-free grammars.- A rational design for a weighted finite-state transducer library.- An efficient null-free procedure for deciding regular language membership.- Operations on extended automata.- Efficient implementation of regular languages using r-AFA.- INTEX: An integrated FST toolbox.- Precise estimation of the order of local testability of a deterministic finite automaton.- Teaching theory of computation with tape machines.- The automata theory package omega.- Practical optimizations for automata.- Sorting and doubling techniques for set partitioning and automata minimization problems.