Language and Automata Theory and Applications [[electronic resource] ] : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers / / edited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIV, 500 p.) |
Disciplina | 401.51 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Compilers (Computer programs) Computer programming Computer science Computer science—Mathematics Formal Languages and Automata Theory Compilers and Interpreters Programming Techniques Theory of Computation Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming |
ISBN | 3-540-88282-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Tree-Walking Automata -- Formal Language Tools for Template-Guided DNA Recombination -- Subsequence Counting, Matrix Representations and a Theorem of Eilenberg -- Synchronizing Automata and the ?erný Conjecture -- Contributed Papers -- About Universal Hybrid Networks of Evolutionary Processors of Small Size -- On Bifix Systems and Generalizations -- Finite Automata, Palindromes, Powers, and Patterns -- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations -- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions -- Optional and Iterated Types for Pregroup Grammars -- Transformations and Preservation of Self-assembly Dynamics through Homotheties -- Deterministic Input-Reversal and Input-Revolving Finite Automata -- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems -- Extending the Overlap Graph for Gene Assembly in Ciliates -- Automatic Presentations for Cancellative Semigroups -- Induced Subshifts and Cellular Automata -- Hopcroft’s Algorithm and Cyclic Automata -- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs -- Consensual Definition of Languages by Regular Sets -- k-Petri Net Controlled Grammars -- 2-Synchronizing Words -- Not So Many Runs in Strings -- A Hybrid Approach to Word Segmentation of Vietnamese Texts -- On Linear Logic Planning and Concurrency -- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) -- Anti-pattern Matching Modulo -- Counting Ordered Patterns in Words Generated by Morphisms -- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups -- Characterization of Star-Connected Languages Using Finite Automata -- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems -- Further Results on Insertion-Deletion Systems with One-Sided Contexts -- On Regularity-Preservation by String-Rewriting Systems -- Minimizing Deterministic Weighted Tree Automata -- Lower Bounds for Generalized Quantum Finite Automata -- How Many Figure Sets Are Codes? -- On Alternating Phrase-Structure Grammars -- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata -- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard -- Sorting and Element Distinctness on One-Way Turing Machines -- On Periodicity of Generalized Two-Dimensional Words -- On the Analysis of “Simple” 2D Stochastic Cellular Automata -- Polycyclic and Bicyclic Valence Automata -- Length Codes, Products of Languages and Primality -- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. |
Record Nr. | UNISA-996465588803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Language and Automata Theory and Applications : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers / / edited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIV, 500 p.) |
Disciplina | 401.51 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Machine theory
Compilers (Computer programs) Computer programming Computer science Computer science—Mathematics Formal Languages and Automata Theory Compilers and Interpreters Programming Techniques Theory of Computation Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming |
ISBN | 3-540-88282-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Tree-Walking Automata -- Formal Language Tools for Template-Guided DNA Recombination -- Subsequence Counting, Matrix Representations and a Theorem of Eilenberg -- Synchronizing Automata and the ?erný Conjecture -- Contributed Papers -- About Universal Hybrid Networks of Evolutionary Processors of Small Size -- On Bifix Systems and Generalizations -- Finite Automata, Palindromes, Powers, and Patterns -- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations -- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions -- Optional and Iterated Types for Pregroup Grammars -- Transformations and Preservation of Self-assembly Dynamics through Homotheties -- Deterministic Input-Reversal and Input-Revolving Finite Automata -- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems -- Extending the Overlap Graph for Gene Assembly in Ciliates -- Automatic Presentations for Cancellative Semigroups -- Induced Subshifts and Cellular Automata -- Hopcroft’s Algorithm and Cyclic Automata -- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs -- Consensual Definition of Languages by Regular Sets -- k-Petri Net Controlled Grammars -- 2-Synchronizing Words -- Not So Many Runs in Strings -- A Hybrid Approach to Word Segmentation of Vietnamese Texts -- On Linear Logic Planning and Concurrency -- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) -- Anti-pattern Matching Modulo -- Counting Ordered Patterns in Words Generated by Morphisms -- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups -- Characterization of Star-Connected Languages Using Finite Automata -- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems -- Further Results on Insertion-Deletion Systems with One-Sided Contexts -- On Regularity-Preservation by String-Rewriting Systems -- Minimizing Deterministic Weighted Tree Automata -- Lower Bounds for Generalized Quantum Finite Automata -- How Many Figure Sets Are Codes? -- On Alternating Phrase-Structure Grammars -- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata -- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard -- Sorting and Element Distinctness on One-Way Turing Machines -- On Periodicity of Generalized Two-Dimensional Words -- On the Analysis of “Simple” 2D Stochastic Cellular Automata -- Polycyclic and Bicyclic Valence Automata -- Length Codes, Products of Languages and Primality -- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. |
Record Nr. | UNINA-9910484243403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Theory and Practice of Natural Computing [[electronic resource] ] : 9th International Conference, TPNC 2020, Taoyuan, Taiwan, December 7–9, 2020, Proceedings / / edited by Carlos Martín-Vide, Miguel A. Vega-Rodríguez, Miin-Shen Yang |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (X, 171 p. 84 illus., 28 illus. in color.) |
Disciplina | 006.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Artificial intelligence Computer networks Database management Theory of Computation Artificial Intelligence Computer Communication Networks Database Management System |
ISBN | 3-030-63000-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Adaptive Coordination of Multiple Learning Strategies in Brains and Robots -- Applications of Natural Computing -- Interactive Sensor-based Virtual Experiment Digital Textbook System on Smart Phone and Learning Cloud -- Solving Hard Problems by Protein Folding? -- A Three-Player Envy-Free Discrete Division Protocol for Mixed Manna -- Convolutional Variational Autoencoders for Audio Feature Representation in Speech Recognition Systems -- Quantum Computing and Unconventional Computing -- Quantum Candies and Quantum Cryptography -- From Practice to Theory: the "Bright Illumination" Attack on Quantum Key Distribution Systems -- Quantum-Inspired Algorithm with Evolution Strategy -- How to Implement a Non-Uniform or Non-Closed Shuffle -- Swarm Intelligence, Evolutionary Algorithms, and DNA Computing -- A Study on Efficient Asynchronous Parallel Multi-Objective Evolutionary Algorithm with Waiting Time Limitation -- Nonlinear Regression in Dynamic Environments Using Particle Swarm Optimization -- Theta Palindromes in Theta Conjugates -- Line Reconfiguration by Programmable Particles Maintaining Connectivity. |
Record Nr. | UNISA-996418297403316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theory and Practice of Natural Computing : 9th International Conference, TPNC 2020, Taoyuan, Taiwan, December 7–9, 2020, Proceedings / / edited by Carlos Martín-Vide, Miguel A. Vega-Rodríguez, Miin-Shen Yang |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (X, 171 p. 84 illus., 28 illus. in color.) |
Disciplina | 006.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Artificial intelligence Computer networks Database management Theory of Computation Artificial Intelligence Computer Communication Networks Database Management System |
ISBN | 3-030-63000-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Adaptive Coordination of Multiple Learning Strategies in Brains and Robots -- Applications of Natural Computing -- Interactive Sensor-based Virtual Experiment Digital Textbook System on Smart Phone and Learning Cloud -- Solving Hard Problems by Protein Folding? -- A Three-Player Envy-Free Discrete Division Protocol for Mixed Manna -- Convolutional Variational Autoencoders for Audio Feature Representation in Speech Recognition Systems -- Quantum Computing and Unconventional Computing -- Quantum Candies and Quantum Cryptography -- From Practice to Theory: the "Bright Illumination" Attack on Quantum Key Distribution Systems -- Quantum-Inspired Algorithm with Evolution Strategy -- How to Implement a Non-Uniform or Non-Closed Shuffle -- Swarm Intelligence, Evolutionary Algorithms, and DNA Computing -- A Study on Efficient Asynchronous Parallel Multi-Objective Evolutionary Algorithm with Waiting Time Limitation -- Nonlinear Regression in Dynamic Environments Using Particle Swarm Optimization -- Theta Palindromes in Theta Conjugates -- Line Reconfiguration by Programmable Particles Maintaining Connectivity. |
Record Nr. | UNINA-9910427667203321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|