Automata implementation : First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996 : revised papers
This book constitutes the strictly refereed post-workshop proceedings of the First International Workshop on Implementing Automata, WIA'96, held in London, Ontario, Canada, in August 1996. The volume presents 13 revised full papers together with an introduction and survey. The papers explore th...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
1260 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
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, First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996, revised papers, Darrell Raymond, Derick Wood, Sheng Yu (eds.), 1997, Berlin, Springer, 1 vol. (VIII-188), Lecture notes in computer science, 3-540-63174-7 • Automata Implementation, Texte imprimé, 9783662214381 |
Sisällysluettelo:
- WIA and the practice of theory in computer science
- Algorithms for guided tree automata
- Time series forecasting by finite-state automata
- Dynamical implementation of nondeterministic automata and concurrent systems
- Implementing WS1S via finite automata
- Instruction computation in subset construction
- Building automaton on schemata and acceptability tables
- FSA utilities: A toolbox to manipulate finite-state automata
- A new quadratic algorithm to convert a regular expression into an automaton
- Implementing sequential and parallel programs for the homing sequence problem
- Integrating hands-on work into the formal languages course via tools and programming
- NFA to DFA transformation for finite languages
- How to use sorting procedures to minimize DFA
- FIRE Lite: FAs and REs in C++.