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 [[electronic resource] ] : 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 [[electronic resource] ] : 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. | UNISA-996466082503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata Implementation [[electronic resource] ] : 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 [[electronic resource] ] : 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 [[electronic resource] ] : 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 [[electronic resource] ] : 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. | UNISA-996465422603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata Implementation [[electronic resource] ] : 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 [[electronic resource] ] : 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 | ||
| ||
Developments in Language Theory [[electronic resource] ] : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings / / edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
| Developments in Language Theory [[electronic resource] ] : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings / / edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 446 p. 48 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Compilers (Computer programs) Computer science Algorithms Machine theory Programming Techniques Compilers and Interpreters Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-642-14455-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D’Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?erný-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?erný Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words. |
| Record Nr. | UNISA-996466431403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
A half-century of automata theory [[electronic resource] ] : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu
| A half-century of automata theory [[electronic resource] ] : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2001 |
| Descrizione fisica | 1 online resource (164 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
SalomaaArto
WoodDerick <1940-> YuSheng |
| Soggetto topico |
Machine theory
Algebra |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-95168-4
9786611951689 981-281-016-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS ; Preface ; Hazard Algebras (Extended Abstract) ; 1 Introduction ; 2 Transients ; 3 Change-Counting Algebra ; 4 Counting Changes to a Threshold ; 5 Circuit Simulations ; 6 Extensions of Boolean Functions ; 7 Complexity Issues ; 8 Conclusions ; References
Undecidability and Incompleteness Results in Automata Theory 1 Introduction ; 2 Basic Concepts and II2-Completeness; 3 Undecidability and Incompleteness Results ; 4 Representation Independent Incompleteness Results ; 5 Incomplete Languages ; 6 Minimal Automata and Incompleteness ; 7 Succinctness Results 8 Conclusion References ; Automata Theory: Its Past and Future ; 1 Introduction ; 2 Beginnings of Automata Theory ; 3 External Changes Impacting Future Directions ; 4 Conclusions ; References ; Forty Years of Formal Power Series in Automata Theory ; 1 Introduction 2 Continuous monoids and semirings 3 Automata and the Theorem of Kleene ; 4 Algebraic systems and pushdown automata ; 5 Principal cones of algebraic power series ; 6 Decidability questions ; References ; Playing Infinite Games in Finite Time ; 1 Infinite games ; 2 The score function 3 Theoretical results about scoring 4 When to end the play ; 5 Finding playable games ; 6 A specific suggestion ; References ; Gene Assembly in Ciliates: Computing by Folding and Recombination ; Introduction. ; 1 Preliminaries. ; 2 DNA molecules: structure and notation. 3 Gene assembly in ciliates. |
| Record Nr. | UNINA-9910450501403321 |
| River Edge, N.J., : World Scientific, c2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A half-century of automata theory [[electronic resource] ] : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu
| A half-century of automata theory [[electronic resource] ] : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2001 |
| Descrizione fisica | 1 online resource (164 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
SalomaaArto
WoodDerick <1940-> YuSheng |
| Soggetto topico |
Machine theory
Algebra |
| ISBN |
1-281-95168-4
9786611951689 981-281-016-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS ; Preface ; Hazard Algebras (Extended Abstract) ; 1 Introduction ; 2 Transients ; 3 Change-Counting Algebra ; 4 Counting Changes to a Threshold ; 5 Circuit Simulations ; 6 Extensions of Boolean Functions ; 7 Complexity Issues ; 8 Conclusions ; References
Undecidability and Incompleteness Results in Automata Theory 1 Introduction ; 2 Basic Concepts and II2-Completeness; 3 Undecidability and Incompleteness Results ; 4 Representation Independent Incompleteness Results ; 5 Incomplete Languages ; 6 Minimal Automata and Incompleteness ; 7 Succinctness Results 8 Conclusion References ; Automata Theory: Its Past and Future ; 1 Introduction ; 2 Beginnings of Automata Theory ; 3 External Changes Impacting Future Directions ; 4 Conclusions ; References ; Forty Years of Formal Power Series in Automata Theory ; 1 Introduction 2 Continuous monoids and semirings 3 Automata and the Theorem of Kleene ; 4 Algebraic systems and pushdown automata ; 5 Principal cones of algebraic power series ; 6 Decidability questions ; References ; Playing Infinite Games in Finite Time ; 1 Infinite games ; 2 The score function 3 Theoretical results about scoring 4 When to end the play ; 5 Finding playable games ; 6 A specific suggestion ; References ; Gene Assembly in Ciliates: Computing by Folding and Recombination ; Introduction. ; 1 Preliminaries. ; 2 DNA molecules: structure and notation. 3 Gene assembly in ciliates. |
| Record Nr. | UNINA-9910783144503321 |
| River Edge, N.J., : World Scientific, c2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A half-century of automata theory : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu
| A half-century of automata theory : celebration and inspiration / / editors, A. Salomaa, D. Wood, S. Yu |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2001 |
| Descrizione fisica | 1 online resource (164 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
SalomaaArto
WoodDerick <1940-> YuSheng |
| Soggetto topico |
Machine theory
Algebra |
| ISBN |
1-281-95168-4
9786611951689 981-281-016-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS ; Preface ; Hazard Algebras (Extended Abstract) ; 1 Introduction ; 2 Transients ; 3 Change-Counting Algebra ; 4 Counting Changes to a Threshold ; 5 Circuit Simulations ; 6 Extensions of Boolean Functions ; 7 Complexity Issues ; 8 Conclusions ; References
Undecidability and Incompleteness Results in Automata Theory 1 Introduction ; 2 Basic Concepts and II2-Completeness; 3 Undecidability and Incompleteness Results ; 4 Representation Independent Incompleteness Results ; 5 Incomplete Languages ; 6 Minimal Automata and Incompleteness ; 7 Succinctness Results 8 Conclusion References ; Automata Theory: Its Past and Future ; 1 Introduction ; 2 Beginnings of Automata Theory ; 3 External Changes Impacting Future Directions ; 4 Conclusions ; References ; Forty Years of Formal Power Series in Automata Theory ; 1 Introduction 2 Continuous monoids and semirings 3 Automata and the Theorem of Kleene ; 4 Algebraic systems and pushdown automata ; 5 Principal cones of algebraic power series ; 6 Decidability questions ; References ; Playing Infinite Games in Finite Time ; 1 Infinite games ; 2 The score function 3 Theoretical results about scoring 4 When to end the play ; 5 Finding playable games ; 6 A specific suggestion ; References ; Gene Assembly in Ciliates: Computing by Folding and Recombination ; Introduction. ; 1 Preliminaries. ; 2 DNA molecules: structure and notation. 3 Gene assembly in ciliates. |
| Record Nr. | UNINA-9910827386903321 |
| River Edge, N.J., : World Scientific, c2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / / edited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu
| Implementation and Application of Automata [[electronic resource] ] : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / / edited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 336 p.) |
| Disciplina | 511.3/5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Computer science Machine theory Algorithms Artificial Intelligence Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-540-30500-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Automata-Theoretic Techniques for Analyzing Infinite-State Systems -- Enumerating Regular Expressions and Their Languages -- Contributed Papers -- A General Weighted Grammar Library -- On the Complexity of Hopcroft’s State Minimization Algorithm -- Implementation of Catalytic P Systems -- Code Selection by Tree Series Transducers -- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages -- Brute Force Determinization of NFAs by Means of State Covers -- Computing the Follow Automaton of an Expression -- Viral Gene Compression: Complexity and Verification -- Concatenation State Machines and Simple Functions -- FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views -- Finding Finite Automata That Certify Termination of String Rewriting -- Linear Encoding Scheme for Weighted Finite Automata -- The Generalization of Generalized Automata: Expression Automata -- An Automata Approach to Match Gapped Sequence Tags Against Protein Database -- State Complexity of Concatenation and Complementation of Regular Languages -- Minimal Unambiguous ?NFA -- Substitutions, Trajectories and Noisy Channels -- State Complexity and the Monoid of Transformations of a Finite Set -- An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract) -- Time and Space Efficient Algorithms for Constrained Sequence Alignment -- Stochastic Context-Free Graph Grammars for Glycoprotein Modelling -- Parametric Weighted Finite Automata for Figure Drawing -- Regional Finite-State Error Repair -- Approximating Dependency Grammars Through Intersection of Regular Languages -- On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata -- Poster Papers -- Tight Bounds for NFA to DFCA Transformations for Binary Alphabets -- Simulating the Process of Gene Assembly in Ciliates -- A BDD-Like Implementation of an Automata Package -- Approximation to the Smallest Regular Expression for a Given Regular Language -- Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory -- Does Hausdorff Dimension Measure Texture Complexity? -- Combining Regular Expressions with (Near-)Optimal Brzozowski Automata -- From Automata to Semilinear Sets: A Logical Solution for Sets ( , ) -- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids -- Minimalizations of NFA Using the Universal Automaton -- Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata -- Size Reduction of Multitape Automata -- Testability of Oracle Automata -- Magic Numbers for Symmetric Difference NFAs. |
| Record Nr. | UNISA-996466028303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 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 [[electronic resource] ] : 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. | UNISA-996465795003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
