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.
Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell
| Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 203 p.) |
| Disciplina | 005.13/1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer science Machine theory Compilers (Computer programs) Computer science—Mathematics Artificial intelligence Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-68103-5 |
| Classificazione | 54.52 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic Equality in Heyting Arithmetic Modulo -- CoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent Types -- Dependently Sorted Logic -- Finiteness in a Minimalist Foundation -- A Declarative Language for the Coq Proof Assistant -- Characterising Strongly Normalising Intuitionistic Sequent Terms -- Intuitionistic vs. Classical Tautologies, Quantitative Comparison -- In the Search of a Naive Type Theory -- Verification of the Redecoration Algorithm for Triangular Matrices -- A Logic for Parametric Polymorphism with Effects -- Working with Mathematical Structures in Type Theory -- On Normalization by Evaluation for Object Calculi -- Attributive Types for Proof Erasure. |
| Record Nr. | UNISA-996465609803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell
| Types for Proofs and Programs [[electronic resource] ] : International Conference, TYPES 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers / / edited by Marino Miculan, Ivan Scagnetto, Furio Honsell |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 203 p.) |
| Disciplina | 005.13/1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer science Machine theory Compilers (Computer programs) Computer science—Mathematics Artificial intelligence Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-68103-5 |
| Classificazione | 54.52 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithmic Equality in Heyting Arithmetic Modulo -- CoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent Types -- Dependently Sorted Logic -- Finiteness in a Minimalist Foundation -- A Declarative Language for the Coq Proof Assistant -- Characterising Strongly Normalising Intuitionistic Sequent Terms -- Intuitionistic vs. Classical Tautologies, Quantitative Comparison -- In the Search of a Naive Type Theory -- Verification of the Redecoration Algorithm for Triangular Matrices -- A Logic for Parametric Polymorphism with Effects -- Working with Mathematical Structures in Type Theory -- On Normalization by Evaluation for Object Calculi -- Attributive Types for Proof Erasure. |
| Record Nr. | UNINA-9910485038503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers / / edited by Thorsten Altenkirch, Conor McBride
| Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers / / edited by Thorsten Altenkirch, Conor McBride |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (VIII, 272 p.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Computer science Machine theory Computer science—Mathematics Artificial intelligence Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-74464-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory -- Crafting a Proof Assistant -- On Constructive Cut Admissibility in Deduction Modulo -- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond -- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq -- Deciding Equality in the Constructor Theory -- A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family -- Truth Values Algebras and Proof Normalization -- Curry-Style Types for Nominal Terms -- (In)consistency of Extensions of Higher Order Logic and Type Theory -- Constructive Type Classes in Isabelle -- Zermelo’s Well-Ordering Theorem in Type Theory -- A Finite First-Order Theory of Classes -- Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers -- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs -- Subset Coercions in Coq -- A Certified Distributed Security Logic for Authorizing Code. |
| Record Nr. | UNISA-996465652703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers / / edited by Thorsten Altenkirch, Conor McBride
| Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers / / edited by Thorsten Altenkirch, Conor McBride |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (VIII, 272 p.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Compilers (Computer programs)
Computer science Machine theory Computer science—Mathematics Artificial intelligence Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-74464-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory -- Crafting a Proof Assistant -- On Constructive Cut Admissibility in Deduction Modulo -- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond -- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq -- Deciding Equality in the Constructor Theory -- A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family -- Truth Values Algebras and Proof Normalization -- Curry-Style Types for Nominal Terms -- (In)consistency of Extensions of Higher Order Logic and Type Theory -- Constructive Type Classes in Isabelle -- Zermelo’s Well-Ordering Theorem in Type Theory -- A Finite First-Order Theory of Classes -- Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers -- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs -- Subset Coercions in Coq -- A Certified Distributed Security Logic for Authorizing Code. |
| Record Nr. | UNINA-9910483766003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / / edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner
| Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / / edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Compilers (Computer programs) Machine theory Computer science—Mathematics Artificial intelligence Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-31429-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formalized Metatheory with Terms Represented by an Indexed Family of Types -- A Content Based Mathematical Search Engine: Whelp -- A Machine-Checked Formalization of the Random Oracle Model -- Extracting a Normalization Algorithm in Isabelle/HOL -- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis -- Formalising Bitonic Sort in Type Theory -- A Semi-reflexive Tactic for (Sub-)Equational Reasoning -- A Uniform and Certified Approach for Two Static Analyses -- Solving Two Problems in General Topology Via Types -- A Tool for Automated Theorem Proving in Agda -- Surreal Numbers in Coq -- A Few Constructions on Constructors -- Tactic-Based Optimized Compilation of Functional Programs -- Interfaces as Games, Programs as Strategies -- ?Z: Zermelo’s Set Theory as a PTS with 4 Sorts -- Exploring the Regular Tree Types -- On Constructive Existence. |
| Record Nr. | UNISA-996466114703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / / edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner
| Types for Proofs and Programs [[electronic resource] ] : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers / / edited by Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Compilers (Computer programs) Machine theory Computer science—Mathematics Artificial intelligence Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-31429-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formalized Metatheory with Terms Represented by an Indexed Family of Types -- A Content Based Mathematical Search Engine: Whelp -- A Machine-Checked Formalization of the Random Oracle Model -- Extracting a Normalization Algorithm in Isabelle/HOL -- A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis -- Formalising Bitonic Sort in Type Theory -- A Semi-reflexive Tactic for (Sub-)Equational Reasoning -- A Uniform and Certified Approach for Two Static Analyses -- Solving Two Problems in General Topology Via Types -- A Tool for Automated Theorem Proving in Agda -- Surreal Numbers in Coq -- A Few Constructions on Constructors -- Tactic-Based Optimized Compilation of Functional Programs -- Interfaces as Games, Programs as Strategies -- ?Z: Zermelo’s Set Theory as a PTS with 4 Sorts -- Exploring the Regular Tree Types -- On Constructive Existence. |
| Record Nr. | UNINA-9910483584903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Computation [[electronic resource] ] : 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings / / edited by Cristian S. Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg
| Unconventional Computation [[electronic resource] ] : 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings / / edited by Cristian S. Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 247 p. 76 illus., 13 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Bioinformatics Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Computer Science Logic and Foundations of Programming Computational and Systems Biology |
| ISBN | 3-642-21341-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465609903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation [[electronic resource] ] : 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010, Proceedings / / edited by Christian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jonathan Timmis
| Unconventional Computation [[electronic resource] ] : 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010, Proceedings / / edited by Christian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jonathan Timmis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 195 p. 68 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Life sciences Computer programming Computer science Algorithms Machine theory Artificial Intelligence Life Sciences Programming Techniques Theory of Computation Formal Languages and Automata Theory |
| ISBN |
1-280-38702-5
9786613564948 3-642-13523-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Computations Inspired from the Brain -- Algebras and Languages for Molecular Programming -- A Computational Journey into Nonlinearity -- Computable Scientists, Uncomputable World -- Regular Contributions -- Finite State Transducers with Intuition -- Reversibility and Determinism in Sequential Multiset Rewriting -- Synchronization in P Modules -- On Universality of Radius 1/2 Number-Conserving Cellular Automata -- DNA Origami as Self-assembling Circuit Boards -- Tug-of-War Model for Multi-armed Bandit Problem -- Characterising Enzymes for Information Processing: Towards an Artificial Experimenter -- Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345 -- Solving Partial Differential Equation via Stochastic Process -- Postselection Finite Quantum Automata -- A New Representation of Chaitin ? Number Based on Compressible Strings -- Quantum Query Algorithms for Conjunctions -- Universal Continuous Variable Quantum Computation in the Micromaser -- Quantum Computation with Devices Whose Contents Are Never Read -- The Extended Glider-Eater Machine in the Spiral Rule -- Posters -- Formalizing the Behavior of Biological Processes with Mobility -- Quantum Finite State Automata over Infinite Words -- A Geometrical Allosteric DNA Switch -- Properties of “Planar Binary (Butchi Number)” -- Characterising Enzymes for Information Processing: Microfluidics for Autonomous Experimentation -- Inference with DNA Molecules -- A Network-Based Computational Model with Learning -- Image Processing with Neuron-Like Branching Elements (POSTER). |
| Record Nr. | UNISA-996466438403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation [[electronic resource] ] : 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010, Proceedings / / edited by Christian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jonathan Timmis
| Unconventional Computation [[electronic resource] ] : 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010, Proceedings / / edited by Christian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jonathan Timmis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 195 p. 68 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Life sciences Computer programming Computer science Algorithms Machine theory Artificial Intelligence Life Sciences Programming Techniques Theory of Computation Formal Languages and Automata Theory |
| ISBN |
1-280-38702-5
9786613564948 3-642-13523-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Computations Inspired from the Brain -- Algebras and Languages for Molecular Programming -- A Computational Journey into Nonlinearity -- Computable Scientists, Uncomputable World -- Regular Contributions -- Finite State Transducers with Intuition -- Reversibility and Determinism in Sequential Multiset Rewriting -- Synchronization in P Modules -- On Universality of Radius 1/2 Number-Conserving Cellular Automata -- DNA Origami as Self-assembling Circuit Boards -- Tug-of-War Model for Multi-armed Bandit Problem -- Characterising Enzymes for Information Processing: Towards an Artificial Experimenter -- Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345 -- Solving Partial Differential Equation via Stochastic Process -- Postselection Finite Quantum Automata -- A New Representation of Chaitin ? Number Based on Compressible Strings -- Quantum Query Algorithms for Conjunctions -- Universal Continuous Variable Quantum Computation in the Micromaser -- Quantum Computation with Devices Whose Contents Are Never Read -- The Extended Glider-Eater Machine in the Spiral Rule -- Posters -- Formalizing the Behavior of Biological Processes with Mobility -- Quantum Finite State Automata over Infinite Words -- A Geometrical Allosteric DNA Switch -- Properties of “Planar Binary (Butchi Number)” -- Characterising Enzymes for Information Processing: Microfluidics for Autonomous Experimentation -- Inference with DNA Molecules -- A Network-Based Computational Model with Learning -- Image Processing with Neuron-Like Branching Elements (POSTER). |
| Record Nr. | UNINA-9910484004203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Computation and Natural Computation [[electronic resource] ] : 15th International Conference, UCNC 2016, Manchester, UK, July 11-15, 2016, Proceedings / / edited by Martyn Amos, Anne Condon
| Unconventional Computation and Natural Computation [[electronic resource] ] : 15th International Conference, UCNC 2016, Manchester, UK, July 11-15, 2016, Proceedings / / edited by Martyn Amos, Anne Condon |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVIII, 197 p. 62 illus.) |
| Disciplina | 006 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Artificial intelligence Computer networks Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Computer Communication Networks |
| ISBN | 3-319-41312-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Reachability Problems for Continuous Chemical Reaction Networks -- An All-Optical Soliton FFT Computational Arrangement in the 3NLSE-domain -- Babbage meets Zuse: A Minimal Mechanical Computer -- Generative Power of Matrix Insertion-deletion Systems with Context-free Insertion or Deletion -- Evolving Carbon Nanotube Reservoir Computers -- Global Network Cooperation Catalysed by a Small Prosocial Migrant Clique -- Model-Based Computation -- In vitro Implementation of a Stack Data Structure Based on DNA Strand Displacement -- Analysis of Boolean Logic Gates Logical Complexity for use with Spiking Memristor Gates -- Language Recognition Power and Succintness of Affine Automata -- Training a Carbon-Nanotube / Liquid Crystal Data Classifier Using Evolutionary Algorithms -- Towards Quantitative Verification of Reaction Systems -- Traversal Languages Capturing Isomorphism Classes on Sierpinski Gaskets -- Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton -- Universal Totalistic Asynchonous Cellular Automaton and its Possible Implementation by DNA. |
| Record Nr. | UNISA-996466007903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
