Automata implementation : third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998 : revised papers
The papers contained in this volume were presented at the third international Workshop on Implementing Automata, held September 17{19,1998, at the U- versity of Rouen, France. Automata theory is the cornerstone of computer science theory. While there is much practical experience with using automata,...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1660 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata implementation, third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, revised papers, Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (eds.), 1999, New York, Springer, 1 vol. (X-243 p.), Lecture notes in computer science, 3-540-66652-4 • Automata Implementation, Texte imprimé, 9783662194485 |
Indholdsfortegnelse:
- 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.