Automata implementation : Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997 : revised papers
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 th...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Müşterek Yazar: | |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
1436 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
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, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, revised papers, Derick Wood, Sheng Yu (eds.), 1998, New York, Springer, 1 vol. (VI-251 p.), Lecture notes in computer science, 3-540-64694-9 • Automata Implementation, Texte imprimé, 9783662195192 |
İçindekiler:
- 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.