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.
Artificial Adaptive Systems Using Auto Contractive Maps [[electronic resource] ] : Theory, Applications and Extensions / / by Paolo Massimo Buscema, Giulia Massini, Marco Breda, Weldon A. Lodwick, Francis Newman, Masoud Asadi-Zeydabadi
| Artificial Adaptive Systems Using Auto Contractive Maps [[electronic resource] ] : Theory, Applications and Extensions / / by Paolo Massimo Buscema, Giulia Massini, Marco Breda, Weldon A. Lodwick, Francis Newman, Masoud Asadi-Zeydabadi |
| Autore | Buscema Paolo Massimo |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (184 pages) |
| Disciplina | 004 |
| Collana | Studies in Systems, Decision and Control |
| Soggetto topico |
Computational intelligence
Data mining Artificial intelligence Mathematical logic Computational Intelligence Data Mining and Knowledge Discovery Artificial Intelligence Mathematical Logic and Foundations |
| ISBN | 3-319-75049-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An Introduction -- Artificial Neural Networks -- Auto-Contractive Maps -- Visualization of Auto-CM Output -- Dataset Transformations and Auto-CM -- Comparison of Auto-CM to Various Other Data Understanding Approaches. |
| Record Nr. | UNINA-9910299947603321 |
Buscema Paolo Massimo
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Aspects of Molecular Computing [[electronic resource] ] : Essays Dedicated to Tom Head on the Occasion of His 70th Birthday / / edited by Natasha Jonoska, Gheorghe Păun, Grzegorz Rozenberg
| Aspects of Molecular Computing [[electronic resource] ] : Essays Dedicated to Tom Head on the Occasion of His 70th Birthday / / edited by Natasha Jonoska, Gheorghe Păun, Grzegorz Rozenberg |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 396 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computer science Mathematical Logic and Foundations Computer Science, general |
| ISBN |
1-280-30666-1
9786610306664 3-540-24635-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving Graph Problems by P Systems with Restricted Elementary Active Membranes -- Writing Information into DNA -- Balance Machines: Computing = Balancing -- Eilenberg P Systems with Symbol-Objects -- Molecular Tiling and DNA Self-assembly -- On Some Classes of Splicing Languages -- The Power of Networks of Watson-Crick D0L Systems -- Fixed Point Approach to Commutation of Languages -- Remarks on Relativisations and DNA Encodings -- Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems -- Digital Information Encoding on DNA -- DNA-based Cryptography -- Splicing to the Limit -- Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs -- n-Insertion on Languages -- Transducers with Programmable Input by DNA Self-assembly -- Methods for Constructing Coded DNA Languages -- On the Universality of P Systems with Minimal Symport/Antiport Rules -- An Algorithm for Testing Structure Freeness of Biomolecular Sequences -- On Languages of Cyclic Words -- A DNA Algorithm for the Hamiltonian Path Problem Using Microfluidic Systems -- Formal Languages Arising from Gene Repeated Duplication -- A Proof of Regularity for Finite Splicing -- The Duality of Patterning in Molecular Genetics -- Membrane Computing: Some Non-standard Ideas -- The P Versus NP Problem Through Cellular Computing with Membranes -- Realizing Switching Functions Using Peptide-Antibody Interactions -- Plasmids to Solve #3SAT -- Communicating Distributed H Systems with Alternating Filters. |
| Record Nr. | UNINA-9910145797803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Aspects of Molecular Computing [[electronic resource] ] : Essays Dedicated to Tom Head on the Occasion of His 70th Birthday / / edited by Natasha Jonoska, Gheorghe Păun, Grzegorz Rozenberg
| Aspects of Molecular Computing [[electronic resource] ] : Essays Dedicated to Tom Head on the Occasion of His 70th Birthday / / edited by Natasha Jonoska, Gheorghe Păun, Grzegorz Rozenberg |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 396 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computer science Mathematical Logic and Foundations Computer Science, general |
| ISBN |
1-280-30666-1
9786610306664 3-540-24635-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving Graph Problems by P Systems with Restricted Elementary Active Membranes -- Writing Information into DNA -- Balance Machines: Computing = Balancing -- Eilenberg P Systems with Symbol-Objects -- Molecular Tiling and DNA Self-assembly -- On Some Classes of Splicing Languages -- The Power of Networks of Watson-Crick D0L Systems -- Fixed Point Approach to Commutation of Languages -- Remarks on Relativisations and DNA Encodings -- Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems -- Digital Information Encoding on DNA -- DNA-based Cryptography -- Splicing to the Limit -- Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs -- n-Insertion on Languages -- Transducers with Programmable Input by DNA Self-assembly -- Methods for Constructing Coded DNA Languages -- On the Universality of P Systems with Minimal Symport/Antiport Rules -- An Algorithm for Testing Structure Freeness of Biomolecular Sequences -- On Languages of Cyclic Words -- A DNA Algorithm for the Hamiltonian Path Problem Using Microfluidic Systems -- Formal Languages Arising from Gene Repeated Duplication -- A Proof of Regularity for Finite Splicing -- The Duality of Patterning in Molecular Genetics -- Membrane Computing: Some Non-standard Ideas -- The P Versus NP Problem Through Cellular Computing with Membranes -- Realizing Switching Functions Using Peptide-Antibody Interactions -- Plasmids to Solve #3SAT -- Communicating Distributed H Systems with Alternating Filters. |
| Record Nr. | UNISA-996466048603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Attribute Grammars, Applications and Systems [[electronic resource] ] : International Summer School SAGA, Prague, Czechoslovakia, June 4-13, 1991. Proceedings / / edited by Henk Alblas, Borivoj Melichar
| Attribute Grammars, Applications and Systems [[electronic resource] ] : International Summer School SAGA, Prague, Czechoslovakia, June 4-13, 1991. Proceedings / / edited by Henk Alblas, Borivoj Melichar |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (IX, 519 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Software engineering Programming languages (Electronic computers) Computer-aided engineering Mathematical Logic and Formal Languages Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Programming Languages, Compilers, Interpreters Software Engineering Computer-Aided Engineering (CAD, CAE) and Design |
| ISBN | 3-540-38490-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | to attribute grammars -- Attribute Grammars as a specification method -- Attribute evaluation methods -- Implementation of visit-oriented attribute evaluators -- Storage allocation for attribute evaluators using stacks and queues -- Grammar flow analysis -- Attribute evaluation and parsing -- Incremental attribute evaluation -- A survey of parallel attribute evaluation methods -- Higher Order Attribute Grammars -- Object-orientation in attribute grammars -- Attribute grammars and logic programs: A comparison of concepts -- Affix grammars for programming languages -- Incremental static semantic analysis for object-oriented languages using Door Attribute Grammars -- Attribute grammars in a compiler construction environment -- Prototyping by using an attribute grammar as a logic program -- Using the generative aspect of attribute grammars in a knowledge based way -- Natural language interface construction using attribute grammars -- Affix grammars for natural languages -- Internals and externals of the FNC-2 attribute grammar system -- An overview of the OPTRAN system -- Attribute reevaluation in OPTRAN -- The translator writing system RUEGEN-KS. |
| Record Nr. | UNISA-996465289303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata Implementation [[electronic resource] ] : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers / / edited by Oliver Boldt, Helmut Jürgensen
| Automata Implementation [[electronic resource] ] : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers / / edited by Oliver Boldt, Helmut Jürgensen |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 189 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Artificial intelligence Computers Pattern recognition Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Artificial Intelligence Computation by Abstract Devices Mathematical Logic and Formal Languages Pattern Recognition |
| ISBN | 3-540-45526-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FA Minimisation Heuristics for a Class of Finite Languages -- SEA: A Symbolic Environment for Automata Theory -- Analysis of Reactive Systems with n Timers -- Animation of the Generation and Computation of Finite Automata for Learning Software -- Metric Lexical Analysis -- State Complexity of Basic Operations on Finite Languages -- Treatment of Unknown Words -- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images -- Thompson Digraphs: A Characterization -- Finite Automata Encoding Geometric Figures -- Compressed Storage of Sparse Finite-State Transducers -- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing -- Multiset Processing by Means of Systems of Finite State Transducers -- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits -- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata -- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. |
| Record Nr. | UNINA-9910143614603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata Implementation [[electronic resource] ] : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers / / edited by Oliver Boldt, Helmut Jürgensen
| Automata Implementation [[electronic resource] ] : 4th International Workshop on Implementing Automata, WIA'99 Potsdam, Germany, July 17-19, 2001 Revised Papers / / edited by Oliver Boldt, Helmut Jürgensen |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 189 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Mathematical logic Artificial intelligence Computers Pattern recognition Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations Artificial Intelligence Computation by Abstract Devices Mathematical Logic and Formal Languages Pattern Recognition |
| ISBN | 3-540-45526-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FA Minimisation Heuristics for a Class of Finite Languages -- SEA: A Symbolic Environment for Automata Theory -- Analysis of Reactive Systems with n Timers -- Animation of the Generation and Computation of Finite Automata for Learning Software -- Metric Lexical Analysis -- State Complexity of Basic Operations on Finite Languages -- Treatment of Unknown Words -- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images -- Thompson Digraphs: A Characterization -- Finite Automata Encoding Geometric Figures -- Compressed Storage of Sparse Finite-State Transducers -- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing -- Multiset Processing by Means of Systems of Finite State Transducers -- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits -- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata -- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata. |
| Record Nr. | UNISA-996465927003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| 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. | 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 | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung
| Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (L, 1482 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Mathematical logic Software engineering Data structures (Computer science) Information theory Artificial intelligence—Data processing Computer Science Mathematical Logic and Foundations Theory of Computation Software Engineering Data Structures and Information Theory Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Data Structures I -- Cryptography and Complexity -- Data Structures II -- Cryptography and Distributed Systems -- Graph Algorithms I -- Security Mechanisms -- Graph Algorithms II -- Automata and Formal Languages I -- Signature and Message Authentication -- Algorithmic Game Theory -- Automata and Logic -- Computational Algebra -- Cache-Oblivious Algorithms and Algorithmic Engineering -- On-line Algorithms -- Security Protocols Logic -- Random Graphs -- Concurrency I -- Encryption and related Primitives -- Approximation Algorithms I -- Games -- Approximation Algorithms II -- Lower Bounds -- Probability -- Approximation Algorithms III -- Automata and Formal Languages II -- Approximation Algorithms IV -- Algebraic Computation and Communication Complexity -- Concurrency II -- String Matching and Computational Biology -- Quantum Complexity -- Analysis and Verification -- Geometry and Load Balancing -- Concrete Complexity and Codes -- Model Theory and Model Checking. |
| Record Nr. | UNISA-996465830303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung
| Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (L, 1482 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Mathematical logic Software engineering Data structures (Computer science) Information theory Artificial intelligence—Data processing Computer Science Mathematical Logic and Foundations Theory of Computation Software Engineering Data Structures and Information Theory Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Data Structures I -- Cryptography and Complexity -- Data Structures II -- Cryptography and Distributed Systems -- Graph Algorithms I -- Security Mechanisms -- Graph Algorithms II -- Automata and Formal Languages I -- Signature and Message Authentication -- Algorithmic Game Theory -- Automata and Logic -- Computational Algebra -- Cache-Oblivious Algorithms and Algorithmic Engineering -- On-line Algorithms -- Security Protocols Logic -- Random Graphs -- Concurrency I -- Encryption and related Primitives -- Approximation Algorithms I -- Games -- Approximation Algorithms II -- Lower Bounds -- Probability -- Approximation Algorithms III -- Automata and Formal Languages II -- Approximation Algorithms IV -- Algebraic Computation and Communication Complexity -- Concurrency II -- String Matching and Computational Biology -- Quantum Complexity -- Analysis and Verification -- Geometry and Load Balancing -- Concrete Complexity and Codes -- Model Theory and Model Checking. |
| Record Nr. | UNINA-9910484429503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
