Implementation and application of automata : 5th international conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000 : revised papers
The Fifth International Conference on Implementation and Application of - tomata (CIAA 2000) was held at the University of Western Ontario in London, Ontario, Canada on July 24-25, 2000. This conference series was formerly called the International Workshop on Implementing Automata (WIA) This volume...
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | , |
| 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
2088 |
| 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: | • Implementation and application of automata, 5th international conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, revised papers, Sheng Yu, Andrei Păun (eds.), 2001, Berlin, Springer, 1 volume (XI-342 p.), Lecture notes in computer science, 3-540-42491-1 • Implementation and Application of Automata, Texte imprimé, 9783662200599 |
İçindekiler:
- Invited Lectures
- Synthesizing State-Based Object Systems from LSC Specifications
- Applications of Finite-State Transducers in Natural Language Processing
- Technical Contributions
- Fast Implementations of Automata Computations
- Regularly Extended Two-Way Nondeterministic Tree Automata
- Glushkov Construction for Multiplicities
- Implicit Structures to Implement NFA s from Regular Expressions
- New Finite Automaton Constructions Based on Canonical Derivatives
- Experiments with Automata Compression
- Computing Raster Images from Grid Picture Grammars
- A Basis for Looping Extensions to Discriminating-Reverse Parsing
- Automata for Pro-V Topologies
- Reachability and Safety in Queue Systems
- Generalizing the Discrete Timed Automaton
- Factorization of Ambiguous Finite-State Transducers
- MONA Implementation Secrets
- Cursors
- An Automaton Model of User-Controlled Navigation on the Web
- Direct Construction of Minimal Acyclic Subsequential Transducers
- Generic ?-Removal Algorithm for Weighted Automata
- An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
- Unary Language Concatenation and Its State Complexity
- Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
- State Complexity and Jacobsthal s Function
- A Package for the Implementation of Block Codes as Finite Automata
- Regional Least-Cost Error Repair
- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
- Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
- The MERLin Environment Applied to ?-NFAs
- Abstracts
- Visual Exploration of Generation Algorithms for Finite Automata on the Web
- TREEBAG
- Word Random Access Compression
- Extended Sequentialization ofTransducers
- Lessons from INR in the Specification of Transductions
- Part-of-Speech Tagging with Two Sequential Transducers
- Solving Complex Problems Efficiently with Adaptive Automata.