Automata Implementation: 4th International Workshop on Implementing Automata, Wia '99 Potsdam, Germany, July 17-19, 2001 Revised Papers - Lecture Notes in Computer Science - O Boldt - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540428121 - 2001. gada 24. oktobris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

O Boldt
Automata Implementation: 4th International Workshop on Implementing Automata, Wia '99 Potsdam, Germany, July 17-19, 2001 Revised Papers - Lecture Notes in Computer Science

Cena
€ 63,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 27. aug. - . gada 10. sept.
Saņemiet paziņojumus par jauniem O Boldt izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

The papers presented in this volume are devoted to issues of implementing automata of various types important for areas such as parsing, finite languages, computational linguistics, speech recognition, image and signal processing, and systems analysis.

Marc Notes: Includes bibliographical references and index. Table of Contents: FA Minimisation Heuristics for a Class of Finite Languages.- SEA: A Symbolic Environment for Automata Theory.- Analysis of Reactive Systems with n Timers.- Animation of the Generation and Computation of Finite Automata for Learning Software.- Metric Lexical Analysis.- State Complexity of Basic Operations on Finite Languages.- Treatment of Unknown Words.- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images.- Thompson Digraphs: A Characterization.- Finite Automata Encoding Geometric Figures.- Compressed Storage of Sparse Finite-State Transducers.- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing.- Multiset Processing by Means of Systems of Finite State Transducers.- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits.- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. Publisher Marketing: This text constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Implementing Automata, WIA'99, held in Potsdam, Germany, in July 1999. The 16 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision. The papers are devoted to issues of implementing automata of various types important for areas such as parsing, finite languages, computational linguistics, speech recognition, image and signal processing, and systems analysis.

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2001. gada 24. oktobris
ISBN13 9783540428121
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 189
Izmēri 156 × 234 × 10 mm   ·   281 g
Valoda Vācu  
Redaktors Boldt, Oliver
Redaktors Jurgensen, Helmut

Vairāk no tā paša izdevēja

Skatīt visus O Boldt ( piem., Paperback Book )