Developments in Language Theory [[electronic resource] ] : 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / / edited by Nataša Jonoska, Dmytro Savchuk |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (342 pages) |
Disciplina | 511.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Natural language processing (Computer science) Computer science—Mathematics Computer networks Logic programming Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Mathematics of Computing Computer Communication Networks Logic in AI |
ISBN | 3-030-48516-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson’s Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoffel Tree According to a Second-order Balancedness. |
Record Nr. | UNISA-996418318103316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Developments in Language Theory : 24th International Conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020, Proceedings / / edited by Nataša Jonoska, Dmytro Savchuk |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (342 pages) |
Disciplina |
511.3
005.131 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Natural language processing (Computer science) Computer science—Mathematics Computer networks Logic programming Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Mathematics of Computing Computer Communication Networks Logic in AI |
ISBN | 3-030-48516-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Equational Theories of Scattered and Countable Series-parallel Posets -- Scattered Factor-Universality of Words -- On Normalish Subgroups of the R. Thompson’s Groups -- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages -- An Approach to the Herzog-Schonheim Conjecture Using Automata -- On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection -- The State Complexity of Lexicographically Smallest Words and Computing Successors -- Reconstructing Words from Right-Bounded-Block Words -- A Study of a Simple Class of Modifiers : Product Modifiers -- Operations on Permutation Automata -- Space Complexity of Stack Automata Models -- Descriptional Complexity of Semi-Simple Splicing Systems -- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations -- Dynamics of Cellular Automata on Beta-Shifts and Direct Topological Factorizations -- Avoidability of Additive Cubes over Alphabets of Four Numbers -- Equivalence of Linear Tree Transducers with Output in the Free Group -- On the Balancedness of Tree-to-word Transducers -- On Tree Substitution Grammars -- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata -- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices -- Avoiding 5/4-powers on the Alphabet of Nonnegative Integers (Extended Abstract) -- Transition Property for α-Power Free Languages with α ≥ 2 and k ≥ 3 Letters -- Context-Freeness of Word-MIX Languages -- The Characterization of the Minimal Paths in the Christoffel Tree According to a Second-order Balancedness. |
Record Nr. | UNINA-9910409664703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Pursuit of the Universal [[electronic resource] ] : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings / / edited by Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVI, 375 p. 21 illus.) |
Disciplina | 511.352 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Machine theory Bioinformatics Theory of Computation Mathematics of Computing Formal Languages and Automata Theory Computational and Systems Biology |
ISBN | 3-319-40189-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computable and constructive analysis -- Computation in biological systems -- Cryptography and information theory -- History and philosophy of computing -- Symbolic dynamics -- Weak arithmetic. |
Record Nr. | UNISA-996465678003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Pursuit of the Universal : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings / / edited by Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XVI, 375 p. 21 illus.) |
Disciplina | 511.352 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Machine theory Bioinformatics Theory of Computation Mathematics of Computing Formal Languages and Automata Theory Computational and Systems Biology |
ISBN | 3-319-40189-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computable and constructive analysis -- Computation in biological systems -- Cryptography and information theory -- History and philosophy of computing -- Symbolic dynamics -- Weak arithmetic. |
Record Nr. | UNINA-9910484131103321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Visions of DNA Nanotechnology at 40 for the Next 40 [[electronic resource] ] : A Tribute to Nadrian C. Seeman / / edited by Nataša Jonoska, Erik Winfree |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 |
Descrizione fisica | 1 online resource (XXVIII, 431 p. 160 illus., 145 illus. in color.) |
Disciplina | 004.0151 |
Collana | Natural Computing Series |
Soggetto topico |
Computer science
Nanotechnology Molecular biology Bionics Models of Computation Molecular Biology Bioinspired Technologies |
ISBN | 981-19-9891-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Beyond Watson-Crick -- DNA nanotechnology out of equilibrium -- The Evolution of DNA-Based Molecular Computing -- DNA Nanotechnology Research in Japan -- Reminiscences from the Trenches -- Beyond DNA -- Controlling single molecule conjugated oligomers and polymers with DNA -- Organizing charge flow with DNA -- DNA Assembly of Dye Aggregates -- Building with DNA -- From Molecules to Mathematics -- Origami Life -- Ok: a kinetic model for locally reconfigurable molecular systems -- Implementing a Theoretician’s Toolkit for Self-Assembly with DNA Components -- Reasoning As If -- Scaling up DNA computing with array-based synthesis and high-throughput sequencing -- Sequenceable Event Recorders -- Computational Design of Nucleic Acid Circuits -- Parallel computations with DNA-encoded chemical reaction networks -- Social DNA Nanorobots -- Models of Gellular Automata -- Patterning DNA origami on membranes through protein self-organization. |
Record Nr. | UNINA-9910774750703321 |
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|