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.
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings / / edited by Revantha Ramanayake, Josef Urban
| Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings / / edited by Revantha Ramanayake, Josef Urban |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (XXV, 482 p. 370 illus., 12 illus. in color.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Computer systems Microprogramming Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Computer System Implementation Control Structures and Microprogramming |
| ISBN | 3-031-43513-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Range-Restricted and Horn Interpolation through Clausal Tableaux -- Non-Classical Logics in Satisfiability Modulo Theories -- DefTab: A Tableaux System for Sceptical Consequence in Default Modal Logics -- Non-distributive description logic -- A new calculus for intuitionistic Strong L\"ob logic: strong termination and cut-elimination, formalized -- Some Analytic Systems of Rules -- A cut-free, sound and complete Russellian theory of definite descriptions -- Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators -- Lemmas: Generation, Selection, Application -- Machine-Learned Premise Selection for Lean -- gym-saturation: Gymnasium environments for saturation provers (System description) -- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points -- Ill-founded Proof Systems For Intuitionistic Linear-time Temporal Logic -- Proof Systems for the Modal $\mu$-Calculus Obtained by Determinizing Automata -- Extensions of K5: Proof Theory and Uniform Lyndon Interpolation -- On intuitionistic diamonds (and lack thereof) -- NP Complexity for Combinations of Non-Normal Modal Logics -- Resolution-based Calculi for Non-Normal Modal Logics -- Canonicity of Proofs in Constructive Modal Logic -- Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic -- The MaxSAT problem in the real-valued MV-algebra -- The Logic of Separation Logic: Models and Proofs -- Testing the Satisfiability of Formulas in Separation Logic with Permissions -- Nested Sequents for Quantified Modal Logics -- A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness. |
| Record Nr. | UNINA-9910744502303321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Beyond the Horizon of Computability [[electronic resource] ] : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings / / edited by Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly
| Beyond the Horizon of Computability [[electronic resource] ] : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings / / edited by Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (xxxvii, 378 pages) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Computer networks Artificial intelligence Theory of Computation Formal Languages and Automata Theory Mathematics of Computing Computer Communication Networks Artificial Intelligence |
| ISBN | 3-030-51466-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Note on Computable Embeddings for Ordinals and Their Reverses -- Clockability for Ordinal Turing Machines -- Some notes on spaces of ideals and computable topology -- Parallelizations in Weihrauch reducibility and constructive reverse mathematics -- Liouville Numbers and the Computational Complexity of Changing Bases -- On Interpretability between some weak essential undecidable theories -- On the Complexity of Conversion between Classic Real Number Representations -- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power -- Computable analysis and classification problems -- Non-coding enumeration operators -- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings -- An interactive proof system for Program extraction -- ASNP: a tame fragment of existential second-order logic -- Ackermannian Goodstein sequences of intermediate growth -- On the complexity of validity degrees in Łukasiewicz logic -- Degrees of non-computability of homeomorphism types of Polish spaces -- Time-aware uniformization of winning strategies -- Quantitative Representation Theory of Compact Metric Spaces -- Functions of Baire class one over a Bishop topology -- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences -- The Computational Significance of Hausdorff's Maximal Chain Principle -- Prefix of trace languages: clique polynomials and dependency graphs -- Repetitions in Toeplitz words and the Thue threshold -- Simulation of automata networks -- Theoretical and Implementation Aspects of the Formal Language Server (LaSer) -- Balancing Straight-Line Programs for Strings and Trees -- Two-dimensional codes -- Formal Languages in Graph Databases and Information Extraction -- On the perceptron's compression -- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method -- Faster Online Computation of the Succinct Longest Previous Factor Array -- Recent advances in text-to-pattern distance algorithms -- Insertion-Deletion Systems With Substitutions: The Context-free Case. |
| Record Nr. | UNISA-996418315203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Beyond the Horizon of Computability [[electronic resource] ] : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings / / edited by Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly
| Beyond the Horizon of Computability [[electronic resource] ] : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings / / edited by Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (xxxvii, 378 pages) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Computer networks Artificial intelligence Theory of Computation Formal Languages and Automata Theory Mathematics of Computing Computer Communication Networks Artificial Intelligence |
| ISBN | 3-030-51466-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Note on Computable Embeddings for Ordinals and Their Reverses -- Clockability for Ordinal Turing Machines -- Some notes on spaces of ideals and computable topology -- Parallelizations in Weihrauch reducibility and constructive reverse mathematics -- Liouville Numbers and the Computational Complexity of Changing Bases -- On Interpretability between some weak essential undecidable theories -- On the Complexity of Conversion between Classic Real Number Representations -- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power -- Computable analysis and classification problems -- Non-coding enumeration operators -- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings -- An interactive proof system for Program extraction -- ASNP: a tame fragment of existential second-order logic -- Ackermannian Goodstein sequences of intermediate growth -- On the complexity of validity degrees in Łukasiewicz logic -- Degrees of non-computability of homeomorphism types of Polish spaces -- Time-aware uniformization of winning strategies -- Quantitative Representation Theory of Compact Metric Spaces -- Functions of Baire class one over a Bishop topology -- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences -- The Computational Significance of Hausdorff's Maximal Chain Principle -- Prefix of trace languages: clique polynomials and dependency graphs -- Repetitions in Toeplitz words and the Thue threshold -- Simulation of automata networks -- Theoretical and Implementation Aspects of the Formal Language Server (LaSer) -- Balancing Straight-Line Programs for Strings and Trees -- Two-dimensional codes -- Formal Languages in Graph Databases and Information Extraction -- On the perceptron's compression -- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method -- Faster Online Computation of the Succinct Longest Previous Factor Array -- Recent advances in text-to-pattern distance algorithms -- Insertion-Deletion Systems With Substitutions: The Context-free Case. |
| Record Nr. | UNINA-9910410055403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott
| Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 421 p. 61 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computers—History Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming History of Computing Computer Science |
| ISBN | 3-642-54789-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semantic Unification: A Sheaf Theoretic Approach to Natural Language -- On Residuation -- Type Similarity for the Lambek-Grishin Calculus Revisited -- NP-Completeness of Grammars Based Upon Products of Free Pregroups -- Distributional Semantics: A Montagovian View -- A Logical Basis for Quantum Evolution and Entanglement -- Learning Lambek Grammars from Proof Frames -- Multi-Sorted Residuation -- Italian Clitic Patterns in Pregroup Grammar: State of the Art -- On Associative Lambek Calculus Extended with Basic Proper Axioms -- Classical Structures Based on Unitaries -- Initial Algebras of Terms with Binding and Algebraic Structure -- Abstract Tensor Systems as Monoidal Categories -- On Canonical Embeddings of Residuated Groupoids -- L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents -- A Note on Multidimensional Dyck Languages -- Extended Lambek Calculi and First-Order Linear Logic -- A Categorial Type Logic -- Chasing Diagrams in Cryptography -- The Monotone Lambek Calculus Is NP-Complete -- A Mathematical Analysis of Masaccio’s Trinity -- Conjoin ability in 1-Discontinuous Lambek Calculus -- The Hidden Structural Rules of the Discontinuous Lambek Calculus. |
| Record Nr. | UNISA-996203614303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott
| Categories and Types in Logic, Language, and Physics [[electronic resource] ] : Essays dedicated to Jim Lambek on the Occasion of this 90th Birthday / / edited by Claudia Casadio, Bob Coecke, Michael Moortgat, Philip Scott |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 421 p. 61 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computers—History Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming History of Computing Computer Science |
| ISBN | 3-642-54789-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semantic Unification: A Sheaf Theoretic Approach to Natural Language -- On Residuation -- Type Similarity for the Lambek-Grishin Calculus Revisited -- NP-Completeness of Grammars Based Upon Products of Free Pregroups -- Distributional Semantics: A Montagovian View -- A Logical Basis for Quantum Evolution and Entanglement -- Learning Lambek Grammars from Proof Frames -- Multi-Sorted Residuation -- Italian Clitic Patterns in Pregroup Grammar: State of the Art -- On Associative Lambek Calculus Extended with Basic Proper Axioms -- Classical Structures Based on Unitaries -- Initial Algebras of Terms with Binding and Algebraic Structure -- Abstract Tensor Systems as Monoidal Categories -- On Canonical Embeddings of Residuated Groupoids -- L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents -- A Note on Multidimensional Dyck Languages -- Extended Lambek Calculi and First-Order Linear Logic -- A Categorial Type Logic -- Chasing Diagrams in Cryptography -- The Monotone Lambek Calculus Is NP-Complete -- A Mathematical Analysis of Masaccio’s Trinity -- Conjoin ability in 1-Discontinuous Lambek Calculus -- The Hidden Structural Rules of the Discontinuous Lambek Calculus. |
| Record Nr. | UNINA-9910484856503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XVII, 105 p. 318 illus., 2 illus. in color.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Numerical analysis Database management Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Numerical Analysis Database Management |
| ISBN | 3-030-20981-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Effects Offering Memory in the Dynamics of Conjunctive Networks -- Complexity-Theoretic Aspects of Expanding Cellular Automata -- Iterative Arrays with Finite Inter-Cell Communication -- Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata -- Enhancement of Automata with Jumping Modes -- Iterative Arrays with Self-Verifying Communication Cell -- Generic Properties in Some Classes of Automation Groups. |
| Record Nr. | UNISA-996466284403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 25th IFIP WG 1.5 International Workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings / / edited by Alonso Castillo-Ramirez, Pedro P. B. de Oliveira |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XVII, 105 p. 318 illus., 2 illus. in color.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Numerical analysis Database management Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Numerical Analysis Database Management |
| ISBN | 3-030-20981-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Effects Offering Memory in the Dynamics of Conjunctive Networks -- Complexity-Theoretic Aspects of Expanding Cellular Automata -- Iterative Arrays with Finite Inter-Cell Communication -- Bounding the Minimal Number of Generators of Groups and Monoids of Cellular Automata -- Enhancement of Automata with Jumping Modes -- Iterative Arrays with Self-Verifying Communication Cell -- Generic Properties in Some Classes of Automation Groups. |
| Record Nr. | UNINA-9910337837203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018, Proceedings / / edited by Jan M. Baetens, Martin Kutrib
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018, Proceedings / / edited by Jan M. Baetens, Martin Kutrib |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (IX, 143 p. 38 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Machine theory Computer science—Mathematics Numerical analysis Theory of Computation Artificial Intelligence Formal Languages and Automata Theory Mathematical Applications in Computer Science Numerical Analysis |
| ISBN | 3-319-92675-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Gauge-Invariant Reversible Cellular Automaton -- Counter Machines and Distributed Automata -- Boolean Networks: Beyond Generalized Asynchronicity -- Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14 -- On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata -- Sequentializing Cellular Automata -- Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan's Theorem -- Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication -- Construction of Some Nonautomatic Sequences by Cellular Automata -- Any Shape can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. |
| Record Nr. | UNISA-996465798103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018, Proceedings / / edited by Jan M. Baetens, Martin Kutrib
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018, Proceedings / / edited by Jan M. Baetens, Martin Kutrib |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (IX, 143 p. 38 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Machine theory Computer science—Mathematics Numerical analysis Theory of Computation Artificial Intelligence Formal Languages and Automata Theory Mathematical Applications in Computer Science Numerical Analysis |
| ISBN | 3-319-92675-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Gauge-Invariant Reversible Cellular Automaton -- Counter Machines and Distributed Automata -- Boolean Networks: Beyond Generalized Asynchronicity -- Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14 -- On Dynamical Complexity of Surjective Ultimately Right-Expansive Cellular Automata -- Sequentializing Cellular Automata -- Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan's Theorem -- Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication -- Construction of Some Nonautomatic Sequences by Cellular Automata -- Any Shape can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models. |
| Record Nr. | UNINA-9910349435803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 201 p. 48 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer simulation Computer networks Computer science—Mathematics Mathematical statistics Machine theory Theory of Computation Computer Modelling Computer Communication Networks Probability and Statistics in Computer Science Formal Languages and Automata Theory |
| ISBN | 3-319-58631-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Two Dimensional Cellular Automata and Computational Complexity -- Fixed Points in Boolean Networks -- Contents -- Invited Papers -- Strict Asymptotic Nilpotency in Cellular Automata -- 1 Introduction -- 2 Nilpotency on Multidimensional Full Shifts -- 3 Nilpotency from a Subset of Configurations -- 4 Nilpotency on Multidimensional Subshifts -- 4.1 SFTs -- 4.2 Sofics (and Beyond) -- 5 Nilpotency as Uniform Convergence to a Point -- 6 Cellular Automata on Graphs and Groups -- 6.1 What Works on General Groups? -- 7 CA with Very Sparse Spacetime Diagrams -- References -- Regular Papers -- Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties -- 1 Introduction -- 2 Preliminaries -- 3 Two-Dimensional Codes -- 4 Infinite Strong Prefix Codes -- 5 Measure of Two-Dimensional Languages and Codes -- References -- Restricted Binary Strings and Generalized Fibonacci Numbers -- 1 Introduction -- 2 A Simple Bijection and Some Applications -- 3 Number of 1's in the Strings of Fn(k) -- 4 Conclusion -- References -- Von Neumann Regular Cellular Automata -- 1 Introduction -- 2 Regular Cellular Automata -- 3 Regular Finite Cellular Automata -- 4 Regular Linear Cellular Automata -- References -- Enumerative Results on the Schröder Pattern Poset -- 1 Introduction -- 2 The Covering Relation in the Schröder Pattern Poset -- 3 Enumerative Results on Pattern Avoiding Schröder Paths -- 3.1 The Pattern (UD)k -- 3.2 The Pattern Uk Dk -- 3.3 The Pattern H2 k -- 3.4 The Pattern UH2 k-1D -- 3.5 The Pattern H2 k-1UD -- 4 Suggestions for Further Work -- References -- Canonical Form of Gray Codes in N-cubes -- 1 Introduction -- 2 Canonical Form of Gray Codes -- 2.1 Isomorphic Cycles -- 2.2 Preliminary Tools -- 2.3 Canonical Form -- 2.4 Examples of Application of C.
2.5 Discussion over the Interest of the Canonical Form -- 3 Balanced Gray Codes Generation Algorithm -- 4 Application -- 4.1 Validation of the Canonical Form and the Generation Algorithm -- 4.2 Application of the Balanced Gray Code Generation Algorithm -- 5 Conclusion -- References -- Equicontinuity and Sensitivity of Nondeterministic Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Cellular Automata -- 2.2 Nondeterministic Cellular Automata -- 3 Equicontinuity -- 4 Sensitivity -- 5 Transitivity -- 6 Conclusions -- References -- Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules -- 1 Introduction -- 2 Definitions -- 3 First Steps in the Space of Diploids -- 3.1 Experimental Protocol -- 3.2 Mixtures with the Null Rule (ECA 0) -- 3.3 Mixtures with the Identity Rule: -asynchronous ECA -- 3.4 Mixtures with the Inversion Rule (ECA 51) -- 4 Discussion -- References -- On the Computational Complexity of the Freezing Non-strict Majority Automata -- 1 Introduction -- 2 Preliminaries -- 3 A Characterization of Stable Sets -- 4 The Algorithm -- 5 Conclusion -- References -- Distortion in One-Head Machines and Cellular Automata -- 1 Introduction -- 2 Definitions -- 2.1 Subshifts and Cellular Automata -- 2.2 Neighborhoods and Radii -- 2.3 Distortion -- 3 Distorted One-Head Machines -- 3.1 One-Head Machines -- 3.2 Speed Trichotomy -- 3.3 Aperiodic Machines -- 3.4 Distortion on Sofic Shifts -- 3.5 Undecidability of Distortion -- 4 Unbalanced Distortion in General Subshifts -- 5 Future Work -- References -- Fast One-Way Cellular Automata with Reversible Mealy Cells -- 1 Introduction -- 2 Preliminaries and Definitions -- 3 The Computational Capacity of One-Way Mealy Cellular Automata with Weakly Reversible Cells -- 4 Reversible One-Way Partitioned Cellular Automata -- 5 Conclusions -- References. Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Latin Squares Generated by Cellular Automata -- 3 Main Results -- 4 Enumeration of Pairwise Balanced Bipermutive Rules -- 5 Conclusions -- References -- Filling Curves Constructed in Cellular Automata with Aperiodic Tiling -- 1 Introduction -- 2 Constructions and Fillings -- 2.1 Cellular Automata -- 2.2 Tile Set -- 3 Aperiodic Tile Set -- 3.1 From Tile Set Determinism to Cellular Automaton -- 3.2 A NW-Deterministic Aperiodic Tile Set -- 4 Aperiodic Filling -- 4.1 Linear Functions -- 4.2 Over-Logarithmic Growth Functions -- 5 Conclusions and Perspectives -- References -- Some Computational Limits of Trellis Automata -- 1 Introduction -- 2 Trellis Automaton -- 3 Factors Diagram for a Language -- 4 Trellis Automaton Patterns and Language Patterns -- 5 Counting Argument -- 6 Some Non Trellis Language -- 7 Conclusion -- References -- Turing-Completeness of Asynchronous Non-camouflage Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Asynchronous CA -- 2.2 Requirements -- 2.3 Priese System -- 3 Proposing Asynchronous Non-camouflage CA -- 3.1 Proposed CA M -- 3.2 Simulation of s-automaton -- 4 Discussion -- References -- Author Index. |
| Record Nr. | UNISA-996466308903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
