Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata Implementation : Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers / / edited by Derick Wood, Sheng Yu
| Automata Implementation : Second International Workshop on Implementing Automata, WIA'97, London, Ontario, Canada, September 18-20, 1997, Revised Papers / / edited by Derick Wood, Sheng Yu |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (IX, 259 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Mathematical logic Pattern recognition Artificial Intelligence Computation by Abstract Devices Mathematical Logic and Formal Languages Pattern Recognition |
| ISBN | 3-540-69104-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910767581303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata Implementation : First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers / / edited by Darrell Raymond, Derick Wood, Sheng Yu
| Automata Implementation : First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29 - 31, 1996, Revised Papers / / edited by Darrell Raymond, Derick Wood, Sheng Yu |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (VIII, 192 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Architecture, Computer Computer logic Computers Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Computer System Implementation Mathematical Logic and Formal Languages Logics and Meanings of Programs Computation by Abstract Devices |
| ISBN | 3-540-69205-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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++. |
| Record Nr. | UNINA-9910767546603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata : 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers / / edited by Sheng Yu, Andrei Paun
| Implementation and Application of Automata : 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers / / edited by Sheng Yu, Andrei Paun |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XI, 342 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Artificial intelligence Architecture, Computer Computers Algorithms Computer logic Programming Techniques Artificial Intelligence Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN | 3-540-44674-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 of Transducers -- Lessons from INR in the Specification of Transductions -- Part-of-Speech Tagging with Two Sequential Transducers -- Solving Complex Problems Efficiently with Adaptive Automata. |
| Record Nr. | UNINA-9910143595803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||