Automata Implementation

Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers

Häftad, Engelska, 1999

Av Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed post-workshop proceedings of the Third International Workshop on Implementing Automata, WIA'98, held in Rouen, France, in September 1998.The 21 revised full papers presented were carefully selected from the workshop contributions after several rounds of reviewing. The papers are devoted to issues of implementing automata of various types important for areas such as parsing, computational linguistics, speech recognition, text searching, device controlers, distributed systems, and protocol analysis.

Produktinformation

Utgivningsdatum1999-10-13
Mått155 x 235 x 15 mm
Vikt400 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor250
Upplaga1999
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540666523

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programspråk inom Data och it
Programmeringsböcker inom Data och it
Matematikens grunder inom Naturvetenskap och teknik
Artificiell intelligens inom Data och it

Extended Context-Free Grammars and Normal Form Algorithms.- On Parsing LL-Languages.- On Parsing and Condensing Substrings of LR Languages in Linear Time.- Minimal Cover-Automata for Finite Languages.- Determinization of Glushkov Automata.- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.- Operations on DASG.- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.- The Syntactic Prediction with Token Automata: Application to HandiAS System.- Bi-directional Automata to Extract Complex Phrases from Texts.- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs.- Using Acceptors as Transducers.- Proving Sequential Function Chart Programs Using Automata.- Automata and Computational Probabilities.- Automata and Binary Decision Diagrams.- Operations over Automata with Multiplicities.- Paging Automata.- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment.- The Finite State Automata’s Design Patterns.- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set.- Autographe: A Graphical Version of Automate.- INTEX 4.1 for Windows: A Walkthrough.