Info
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 : 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 : 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 | ||
| ||
Combinatorics on Words [[electronic resource] ] : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings / / edited by Florin Manea, Dirk Nowotka
| Combinatorics on Words [[electronic resource] ] : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings / / edited by Florin Manea, Dirk Nowotka |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 237 p. 47 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Discrete mathematics Artificial intelligence Software engineering Formal Languages and Automata Theory Theory of Computation Discrete Mathematics in Computer Science Artificial Intelligence Software Engineering |
| ISBN | 3-319-23660-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Degrees of Transducibility -- Equality Testing of Compressed Strings -- On the Contribution of WORDS to the Field of Combinatorics on Words -- Codes and Automata in Minimal Sets -- Decidability of Abelian-Power-Freeness and Generalizations -- Thue-Morse Along Two Polynomial Subsequences -- Contents -- Degrees of Transducibility -- 1 Introduction -- 2 Preliminaries -- 2.1 Finite State Transducers and Mealy Machines -- 2.2 Degrees of Transducibility -- 3 Comparison -- 4 Atoms and Polynomials -- 5 A Plethora of Questions -- References -- Equality Testing of Compressed Strings -- 1 Introduction -- 2 Straight-Line Programs -- 3 Sequential Algorithms -- 4 A Parallel Algorithm -- 5 Related Problems -- 6 Open Problems -- References -- On the Contribution of WORDS to the Field of Combinatorics on Words -- References -- Codes and Automata in Minimal Sets -- 1 Introduction -- 2 Neutral and Tree Sets -- 2.1 Neutral Sets -- 2.2 Tree Sets -- 3 Automata -- 4 Codes -- 4.1 A Cardinality Theorem for Prefix Codes -- 4.2 The Group of a Bifix Code -- References -- Thue--Morse Along Two Polynomial Subsequences -- 1 Introduction -- 2 Thue--Morse at Distinct Multiples -- 3 Thue--Morse at Two Polynomials -- References -- Canonical Representatives of Morphic Permutations -- 1 Introduction -- 2 Basic Definitions -- 3 Ergodic Permutations -- 4 Ergodic Permutations Generated by Words -- 4.1 Morphisms on Words and Intervals -- References -- Linear-Time Computation of Prefix Table for Weighted Strings -- 1 Introduction -- 2 Properties and Auxiliary Data Structures -- 3 Algorithm -- 4 Final Remarks -- References -- New Formulas for Dyck Paths in a Rectangle -- 1 Introduction -- 2 Definitions and Notation -- 3 Ferrers Diagrams Comparison Method -- 3.1 Diagrams Decomposition Method -- 3.2 Technical Results.
4 Theorems -- 5 Examples -- 5.1 Example D8,8n+6 -- 5.2 Example D6,6n+2 -- 5.3 Example D6,9. -- References -- Ambiguity of Morphisms in a Free Group -- 1 Introduction -- 2 Preliminaries -- 3 Basic Ambiguity -- 4 Unambiguous Injective Morphisms -- 4.1 Main Theorem -- 4.2 Proof Outline -- 5 Patterns with Terminal Symbols -- References -- The Degree of Squares is an Atom -- 1 Introduction -- 2 Preliminaries -- 3 Finite-State Transducers and Degrees -- 4 Characterising Transducts of Spiralling Sequences -- 5 Squares -- References -- Words with the Maximum Number of Abelian Squares -- 1 Introduction -- 2 Notation and Background -- 3 Abelian-square Rich Words -- 3.1 The Thue-Morse Word -- 3.2 Sturmian Words -- 4 Conclusions and Future Work -- References -- Arithmetics on Suffix Arrays of Fibonacci Words -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Suffix Array and Its Inverse -- 5 Burrows-Wheeler Transform -- 6 Outlook -- References -- Prefix-Suffix Square Completion -- 1 Introduction -- 2 Definitions -- 3 Generating Infinite Words -- 4 Finite Words: Algorithms -- 5 Future Work -- References -- Square-Density Increasing Mappings -- 1 Introduction -- 2 Preliminaries -- 3 Fractional-Power Density Increasing Mappings to Expand the Alphabet -- 3.1 Fractional-Power Density Preserving Quaternarizer -- 3.2 Fractional-Power Density Preserving Mappings to Double the Alphabet Size -- 4 Strictly Square-Density Increasing Mappings -- 4.1 Strictly Square-Density Increasing Alphabet Downsizer -- 5 Future Work -- References -- Mechanical Proofs of Properties of the Tribonacci Word -- 1 Introduction -- 2 Tribonacci Representation -- 3 Mechanical Proofs of Properties of the Infinite Tribonacci Word -- 3.1 Repetitions -- 4 Enumeration -- 5 Additional Results -- 5.1 Palindromes -- 5.2 Quasiperiods -- 5.3 Unbordered Factors -- 5.4 Lyndon Words. 5.5 Critical Exponent -- 6 Abelian Properties -- 7 Things We Could Not Do Yet -- References -- On Arithmetic Progressions in the Generalized Thue-Morse Word -- 1 Introduction -- 2 Preliminaries -- 3 Main Result -- 3.1 Case of d=3n-1 -- 3.2 Case of d=3n-1 -- 4 Conclusion -- References -- A Square Root Map on Sturmian Words -- 1 Introduction -- 2 Notation and Preliminary Results -- 2.1 Optimal Squareful Words -- 2.2 Continued Fractions -- 2.3 Sturmian Words -- 2.4 Powers in Sturmian Words -- 3 The Square Root Map -- 4 One Characterization of Words Satisfying the Square Root Condition -- 5 Characterization by a Word Equation -- 6 A More Detailed Combinatorial Description of the Square Root Map -- References -- Specular Sets -- 1 Introduction -- 2 Preliminaries -- 3 Specular Groups -- 4 Specular Sets -- 5 Subgroup Theorems -- References -- On the Tree of Ternary Square-Free Words -- 1 Introduction -- 2 Definitions and Notation -- 3 Letters Fixed by Short Squares -- 4 Long Squares -- 5 Discussion -- References -- Author Index. |
| Record Nr. | UNISA-996200359103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics on Words : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings / / edited by Florin Manea, Dirk Nowotka
| Combinatorics on Words : 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings / / edited by Florin Manea, Dirk Nowotka |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 237 p. 47 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Discrete mathematics Artificial intelligence Software engineering Formal Languages and Automata Theory Theory of Computation Discrete Mathematics in Computer Science Artificial Intelligence Software Engineering |
| ISBN | 3-319-23660-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Degrees of Transducibility -- Equality Testing of Compressed Strings -- On the Contribution of WORDS to the Field of Combinatorics on Words -- Codes and Automata in Minimal Sets -- Decidability of Abelian-Power-Freeness and Generalizations -- Thue-Morse Along Two Polynomial Subsequences -- Contents -- Degrees of Transducibility -- 1 Introduction -- 2 Preliminaries -- 2.1 Finite State Transducers and Mealy Machines -- 2.2 Degrees of Transducibility -- 3 Comparison -- 4 Atoms and Polynomials -- 5 A Plethora of Questions -- References -- Equality Testing of Compressed Strings -- 1 Introduction -- 2 Straight-Line Programs -- 3 Sequential Algorithms -- 4 A Parallel Algorithm -- 5 Related Problems -- 6 Open Problems -- References -- On the Contribution of WORDS to the Field of Combinatorics on Words -- References -- Codes and Automata in Minimal Sets -- 1 Introduction -- 2 Neutral and Tree Sets -- 2.1 Neutral Sets -- 2.2 Tree Sets -- 3 Automata -- 4 Codes -- 4.1 A Cardinality Theorem for Prefix Codes -- 4.2 The Group of a Bifix Code -- References -- Thue--Morse Along Two Polynomial Subsequences -- 1 Introduction -- 2 Thue--Morse at Distinct Multiples -- 3 Thue--Morse at Two Polynomials -- References -- Canonical Representatives of Morphic Permutations -- 1 Introduction -- 2 Basic Definitions -- 3 Ergodic Permutations -- 4 Ergodic Permutations Generated by Words -- 4.1 Morphisms on Words and Intervals -- References -- Linear-Time Computation of Prefix Table for Weighted Strings -- 1 Introduction -- 2 Properties and Auxiliary Data Structures -- 3 Algorithm -- 4 Final Remarks -- References -- New Formulas for Dyck Paths in a Rectangle -- 1 Introduction -- 2 Definitions and Notation -- 3 Ferrers Diagrams Comparison Method -- 3.1 Diagrams Decomposition Method -- 3.2 Technical Results.
4 Theorems -- 5 Examples -- 5.1 Example D8,8n+6 -- 5.2 Example D6,6n+2 -- 5.3 Example D6,9. -- References -- Ambiguity of Morphisms in a Free Group -- 1 Introduction -- 2 Preliminaries -- 3 Basic Ambiguity -- 4 Unambiguous Injective Morphisms -- 4.1 Main Theorem -- 4.2 Proof Outline -- 5 Patterns with Terminal Symbols -- References -- The Degree of Squares is an Atom -- 1 Introduction -- 2 Preliminaries -- 3 Finite-State Transducers and Degrees -- 4 Characterising Transducts of Spiralling Sequences -- 5 Squares -- References -- Words with the Maximum Number of Abelian Squares -- 1 Introduction -- 2 Notation and Background -- 3 Abelian-square Rich Words -- 3.1 The Thue-Morse Word -- 3.2 Sturmian Words -- 4 Conclusions and Future Work -- References -- Arithmetics on Suffix Arrays of Fibonacci Words -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 The Suffix Array and Its Inverse -- 5 Burrows-Wheeler Transform -- 6 Outlook -- References -- Prefix-Suffix Square Completion -- 1 Introduction -- 2 Definitions -- 3 Generating Infinite Words -- 4 Finite Words: Algorithms -- 5 Future Work -- References -- Square-Density Increasing Mappings -- 1 Introduction -- 2 Preliminaries -- 3 Fractional-Power Density Increasing Mappings to Expand the Alphabet -- 3.1 Fractional-Power Density Preserving Quaternarizer -- 3.2 Fractional-Power Density Preserving Mappings to Double the Alphabet Size -- 4 Strictly Square-Density Increasing Mappings -- 4.1 Strictly Square-Density Increasing Alphabet Downsizer -- 5 Future Work -- References -- Mechanical Proofs of Properties of the Tribonacci Word -- 1 Introduction -- 2 Tribonacci Representation -- 3 Mechanical Proofs of Properties of the Infinite Tribonacci Word -- 3.1 Repetitions -- 4 Enumeration -- 5 Additional Results -- 5.1 Palindromes -- 5.2 Quasiperiods -- 5.3 Unbordered Factors -- 5.4 Lyndon Words. 5.5 Critical Exponent -- 6 Abelian Properties -- 7 Things We Could Not Do Yet -- References -- On Arithmetic Progressions in the Generalized Thue-Morse Word -- 1 Introduction -- 2 Preliminaries -- 3 Main Result -- 3.1 Case of d=3n-1 -- 3.2 Case of d=3n-1 -- 4 Conclusion -- References -- A Square Root Map on Sturmian Words -- 1 Introduction -- 2 Notation and Preliminary Results -- 2.1 Optimal Squareful Words -- 2.2 Continued Fractions -- 2.3 Sturmian Words -- 2.4 Powers in Sturmian Words -- 3 The Square Root Map -- 4 One Characterization of Words Satisfying the Square Root Condition -- 5 Characterization by a Word Equation -- 6 A More Detailed Combinatorial Description of the Square Root Map -- References -- Specular Sets -- 1 Introduction -- 2 Preliminaries -- 3 Specular Groups -- 4 Specular Sets -- 5 Subgroup Theorems -- References -- On the Tree of Ternary Square-Free Words -- 1 Introduction -- 2 Definitions and Notation -- 3 Letters Fixed by Short Squares -- 4 Long Squares -- 5 Discussion -- References -- Author Index. |
| Record Nr. | UNINA-9910483773103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing with Foresight and Industry [[electronic resource] ] : 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings / / edited by Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero
| Computing with Foresight and Industry [[electronic resource] ] : 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings / / edited by Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XII, 323 p. 479 illus., 12 illus. in color.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Machine theory Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-030-22996-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466343303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing with Foresight and Industry : 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings / / edited by Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero
| Computing with Foresight and Industry : 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings / / edited by Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XII, 323 p. 479 illus., 12 illus. in color.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Machine theory Artificial intelligence - Data processing Computer science - Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-030-22996-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910349315503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Crossroads of Computability and Logic: Insights, Inspirations, and Innovations : 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings / / edited by Arnold Beckmann, Isabel Oitavem, Florin Manea
| Crossroads of Computability and Logic: Insights, Inspirations, and Innovations : 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings / / edited by Arnold Beckmann, Isabel Oitavem, Florin Manea |
| Autore | Beckmann Arnold |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (1119 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
OitavemIsabel
ManeaFlorin |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical Machine theory Algorithms Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Formal Languages and Automata Theory Design and Analysis of Algorithms Mathematics of Computing |
| ISBN | 3-031-95908-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- Invited Papers. -- The CDSAT Method for Satisfiability Modulo Theories and Assignment: an Exposition. -- Effective second countability in computable analysis. -- Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program. -- Represented spaces of represented spaces. -- Computation with Real Numbers and Continuous-Time Dynamical Systems. -- Proof-Carrying Neuro-Symbolic Code. -- Uniform Functional Interpretations. -- Computable Analysis for Extraction of Certified Programs and its Applications. -- Contributed Papers. -- The existence of primitive recursive structures. -- Space-bounded online Kolmogorov complexity is additive. -- On learning existentially definable subsets in a computable structure. -- Transfinite structured programming. -- Computability of Real Functions with Oracle Pointer Machines implies Real-Time simulation of Chemical Reaction Networks. -- Computability of Initial Value Problems. -- Full generalized effective reducibility. -- On S-Degrees of some Representations of Irrational Numbers. -- Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs. -- Binary Expansions of Regular Reals and Reordered Computable Numbers. -- Properties of Range Sets of Continuous Functions in Reverse Mathematics. -- The theory of reachability of trace-pushdown systems. -- A point to set principle for finite-state dimension and relativized equidistribution porperties. -- Some structural complexity results for $\exists \mathbb R$. -- On the computational power of C-random strings. -- Generalized learnability of stochastic principles. -- Computably discrete represented spaces. -- Multidimensional tilings and MSO logic. -- Injectivity of polynomials over finite discrete dynamical systems. -- Weihrauch problems as containers. -- On the reverse mathematics of cut-elimination and determinacy. -- $L {\omega\omega}$, $L {\omega 1\omega}$, and Wadge hierarchy. -- Ordinal Invariants of the $h$-Preorder on $k$-Labeled Forests. -- Completeness theorems for modal logic in second-order arithmetic. -- Variants of Solovay reducibility. -- Constructive Analysis of Maximal Ideals in Z[X] by the Material Interpretation. -- Alternation-Bounded Semi-Unbounded Fan-in Cascading Circuits and the Complementation Closure Property. |
| Record Nr. | UNINA-9911011773103321 |
Beckmann Arnold
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Crossroads of Computability and Logic: Insights, Inspirations, and Innovations : 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings / / edited by Arnold Beckmann, Isabel Oitavem, Florin Manea
| Crossroads of Computability and Logic: Insights, Inspirations, and Innovations : 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14–18, 2025, Proceedings / / edited by Arnold Beckmann, Isabel Oitavem, Florin Manea |
| Autore | Beckmann Arnold |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (1119 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
OitavemIsabel
ManeaFlorin |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical Machine theory Algorithms Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Formal Languages and Automata Theory Design and Analysis of Algorithms Mathematics of Computing |
| ISBN | 3-031-95908-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- Invited Papers. -- The CDSAT Method for Satisfiability Modulo Theories and Assignment: an Exposition. -- Effective second countability in computable analysis. -- Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program. -- Represented spaces of represented spaces. -- Computation with Real Numbers and Continuous-Time Dynamical Systems. -- Proof-Carrying Neuro-Symbolic Code. -- Uniform Functional Interpretations. -- Computable Analysis for Extraction of Certified Programs and its Applications. -- Contributed Papers. -- The existence of primitive recursive structures. -- Space-bounded online Kolmogorov complexity is additive. -- On learning existentially definable subsets in a computable structure. -- Transfinite structured programming. -- Computability of Real Functions with Oracle Pointer Machines implies Real-Time simulation of Chemical Reaction Networks. -- Computability of Initial Value Problems. -- Full generalized effective reducibility. -- On S-Degrees of some Representations of Irrational Numbers. -- Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs. -- Binary Expansions of Regular Reals and Reordered Computable Numbers. -- Properties of Range Sets of Continuous Functions in Reverse Mathematics. -- The theory of reachability of trace-pushdown systems. -- A point to set principle for finite-state dimension and relativized equidistribution porperties. -- Some structural complexity results for $\exists \mathbb R$. -- On the computational power of C-random strings. -- Generalized learnability of stochastic principles. -- Computably discrete represented spaces. -- Multidimensional tilings and MSO logic. -- Injectivity of polynomials over finite discrete dynamical systems. -- Weihrauch problems as containers. -- On the reverse mathematics of cut-elimination and determinacy. -- $L {\omega\omega}$, $L {\omega 1\omega}$, and Wadge hierarchy. -- Ordinal Invariants of the $h$-Preorder on $k$-Labeled Forests. -- Completeness theorems for modal logic in second-order arithmetic. -- Variants of Solovay reducibility. -- Constructive Analysis of Maximal Ideals in Z[X] by the Material Interpretation. -- Alternation-Bounded Semi-Unbounded Fan-in Cascading Circuits and the Complementation Closure Property. |
| Record Nr. | UNISA-996664554003316 |
|
Beckmann Arnold
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 217 p. 50 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-319-41114-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Completely Reachable Automata -- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy -- Heapability, interactive particle systems, partial orders: results and open problems -- Self-Verifying Finite Automata and Descriptional Complexity -- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection -- Unrestricted State Complexity of Binary Operations on Regular Languages -- On the State Complexity of the Shuffle of Regular Languages -- MSO-definable properties of Muller context-free languages are decidable -- Contextual Array Grammars with Matrix and Regular Control -- Descriptional Complexity of Graph-controlled Insertion-deletion Systems -- Operations on Weakly Recognizing Morphisms -- Descriptional Complexity of Bounded Regular Languages -- The Complexity of Languages Resulting from the Concatenation Operation -- Minimal and Reduced Reversible Automata. |
| Record Nr. | UNISA-996465824503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit
| Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 217 p. 50 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-319-41114-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Completely Reachable Automata -- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy -- Heapability, interactive particle systems, partial orders: results and open problems -- Self-Verifying Finite Automata and Descriptional Complexity -- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection -- Unrestricted State Complexity of Binary Operations on Regular Languages -- On the State Complexity of the Shuffle of Regular Languages -- MSO-definable properties of Muller context-free languages are decidable -- Contextual Array Grammars with Matrix and Regular Control -- Descriptional Complexity of Graph-controlled Insertion-deletion Systems -- Operations on Weakly Recognizing Morphisms -- Descriptional Complexity of Bounded Regular Languages -- The Complexity of Languages Resulting from the Concatenation Operation -- Minimal and Reduced Reversible Automata. |
| Record Nr. | UNINA-9910484658103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
