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.
Developments in Language Theory [[electronic resource] ] : 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings / / edited by Mizuho Hoshi, Shinnosuke Seki
| Developments in Language Theory [[electronic resource] ] : 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings / / edited by Mizuho Hoshi, Shinnosuke Seki |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIV, 568 p. 86 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Artificial intelligence Data structures (Computer science) Information theory Computer science—Mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Data Structures and Information Theory Mathematics of Computing |
| ISBN | 3-319-98654-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Block sorting-based transformations on words: beyond the magic BWT -- The Runs Theorem and Beyond -- A Brief Excursion to Parity Games -- A tale of conjunctive grammars -- Groups, languages and dendric shifts -- Some Open Problems in Polyomino Tilings -- Weak Cost Register Automata are Still Powerful -- From Two-Way Transducers to Regular Function Expressions -- Decidability of Right One-Way Jumping Finite Automata -- Additive Number Theory via Approximation by Regular Languages -- Tree-to-graph transductions with scope -- A Characterization of Completely Reachable Automata -- Inequalities for one-step products -- On the commutative equivalence of context-free languages -- Simon's theorem for scattered words -- The Synchronizing Probability Function for Primitive Sets of Matrices -- Recognizability for automata -- Site-Directed Deletion -- Counting Subwords and Regular Languages -- Deque languages, automata and planar graphs -- A General Approach to State Complexity of Operations: Formalization and Limitations -- On Matching Generalised Repetitive Patterns -- Intersection Non-Emptiness and Hardness within Polynomial Time -- Complexity of decision problems on totally rigid acyclic tree grammars -- A Pattern Logic for Automata with Outputs -- The Intersection Problem for Finite Semigroups -- On Completely Reachable Automata and Subset Reachability -- On Minimal Grammar Problems for Finite Languages -- Reversible Pushdown Transducers -- Two-way Automata and One-Tape Machines: Read Only versus Linear Time -- Dynamics of the Independence Number and Automata Synchronization -- Closest Substring Problems for Regular Languages -- Computational Complexity of Decision Problems on Self-Verifying Finite Automata -- Generalizations of Checking Stack Automata: Characterizations and Hierarchies -- On Counting Functions of Languages -- Towards exact state complexity bounds for input-driven pushdown automata -- On Abelian Subshifts -- Reachability Problems in Nondeterministic Polynomial Maps on the Integers -- Projection for Büchi Tree Automata with Constraints between Siblings -- The Computational Power of Parsing Expression Grammars -- On finitely ambiguous Büchi automata -- Uniformization Problem for Variants of First Order Logic over Finite Words -- On deterministic ordered restart-delete automata -- Complementation of Finitely Ambiguous Büchi Automata -- A Structural Lemma for Deterministic Context-Free Languages. |
| Record Nr. | UNISA-996466074803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Developments in Language Theory : 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings / / edited by Mizuho Hoshi, Shinnosuke Seki
| Developments in Language Theory : 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings / / edited by Mizuho Hoshi, Shinnosuke Seki |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIV, 568 p. 86 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Artificial intelligence Data structures (Computer science) Information theory Computer science—Mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Data Structures and Information Theory Mathematics of Computing |
| ISBN | 3-319-98654-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Block sorting-based transformations on words: beyond the magic BWT -- The Runs Theorem and Beyond -- A Brief Excursion to Parity Games -- A tale of conjunctive grammars -- Groups, languages and dendric shifts -- Some Open Problems in Polyomino Tilings -- Weak Cost Register Automata are Still Powerful -- From Two-Way Transducers to Regular Function Expressions -- Decidability of Right One-Way Jumping Finite Automata -- Additive Number Theory via Approximation by Regular Languages -- Tree-to-graph transductions with scope -- A Characterization of Completely Reachable Automata -- Inequalities for one-step products -- On the commutative equivalence of context-free languages -- Simon's theorem for scattered words -- The Synchronizing Probability Function for Primitive Sets of Matrices -- Recognizability for automata -- Site-Directed Deletion -- Counting Subwords and Regular Languages -- Deque languages, automata and planar graphs -- A General Approach to State Complexity of Operations: Formalization and Limitations -- On Matching Generalised Repetitive Patterns -- Intersection Non-Emptiness and Hardness within Polynomial Time -- Complexity of decision problems on totally rigid acyclic tree grammars -- A Pattern Logic for Automata with Outputs -- The Intersection Problem for Finite Semigroups -- On Completely Reachable Automata and Subset Reachability -- On Minimal Grammar Problems for Finite Languages -- Reversible Pushdown Transducers -- Two-way Automata and One-Tape Machines: Read Only versus Linear Time -- Dynamics of the Independence Number and Automata Synchronization -- Closest Substring Problems for Regular Languages -- Computational Complexity of Decision Problems on Self-Verifying Finite Automata -- Generalizations of Checking Stack Automata: Characterizations and Hierarchies -- On Counting Functions of Languages -- Towards exact state complexity bounds for input-driven pushdown automata -- On Abelian Subshifts -- Reachability Problems in Nondeterministic Polynomial Maps on the Integers -- Projection for Büchi Tree Automata with Constraints between Siblings -- The Computational Power of Parsing Expression Grammars -- On finitely ambiguous Büchi automata -- Uniformization Problem for Variants of First Order Logic over Finite Words -- On deterministic ordered restart-delete automata -- Complementation of Finitely Ambiguous Büchi Automata -- A Structural Lemma for Deterministic Context-Free Languages. |
| Record Nr. | UNINA-9910349410803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Developments in Language Theory [[electronic resource] ] : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings / / edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
| Developments in Language Theory [[electronic resource] ] : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings / / edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 446 p. 48 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Compilers (Computer programs) Computer science Algorithms Machine theory Programming Techniques Compilers and Interpreters Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-642-14455-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D’Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?erný-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?erný Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words. |
| Record Nr. | UNISA-996466431403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Developments in Language Theory : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings / / edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
| Developments in Language Theory : 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, Proceedings / / edited by Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XII, 446 p. 48 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Compilers (Computer programs) Computer science Algorithms Machine theory Programming Techniques Compilers and Interpreters Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-642-14455-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Reaction Systems: A Model of Computation Inspired by Biochemistry -- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages -- The Complexity of Regular(-Like) Expressions -- On Decision Problems for Simple and Parameterized Machines -- DNA Computing and Its Implications for Theoretical Computer Science -- Numeration Systems: A Link between Number Theory and Formal Language Theory -- Regular Papers -- Algorithmic Properties of Millstream Systems -- On a Conjecture by Carpi and D’Alessandro -- Linking Algebraic Observational Equivalence and Bisimulation -- Undecidability and Hierarchy Results for Parallel Communicating Finite Automata -- Inclusion Problems for Patterns with a Bounded Number of Variables -- On the Average Number of States of Partial Derivative Automata -- On the Hybrid ?erný-Road Coloring Problem and Hamiltonian Paths -- Computing Blocker Sets for the Regular Post Embedding Problem -- Rankers over Infinite Words -- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices -- On Müller Context-Free Grammars -- Minimization of Deterministic Bottom-Up Tree Transducers -- Two-Way Unary Automata versus Logarithmic Space -- On the Periodicity of Morphic Words -- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups -- Using Light to Implement Parallel Boolean Algebra -- Periodicity in Tilings -- Complexity in Union-Free Regular Languages -- Schema for Parallel Insertion and Deletion -- On Schützenberger Products of Semirings -- On Language Equations XXK?=?XXL and XM?=?N over a Unary Alphabet -- Around Dot Depth Two -- Input Products for Weighted Extended Top-Down Tree Transducers -- Regular Hedge Language Factorization Revisited -- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm -- On Lexicalized Well-Behaved Restarting Automata That Are Monotone -- On a Powerful Class of Non-universal P Systems with Active Membranes -- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages -- Restricted Ambiguity of Erasing Morphisms -- Automata with Extremal Minimality Conditions -- On the Existence of Minimal ?-Powers -- The Averaging Trick and the ?erný Conjecture -- Short Papers -- Pseudo-power Avoidance -- On Restricted Context-Free Grammars -- Graphs Capturing Alternations in Words -- On the Iterated Hairpin Completion -- On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) -- Joint Topologies for Finite and Infinite Words. |
| Record Nr. | UNINA-9910483494703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Unconventional Computation and Natural Computation [[electronic resource] ] : 18th International Conference, UCNC 2019, Tokyo, Japan, June 3–7, 2019, Proceedings / / edited by Ian McQuillan, Shinnosuke Seki
| Unconventional Computation and Natural Computation [[electronic resource] ] : 18th International Conference, UCNC 2019, Tokyo, Japan, June 3–7, 2019, Proceedings / / edited by Ian McQuillan, Shinnosuke Seki |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XX, 287 p. 247 illus., 61 illus. in color.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Numerical analysis Computer science - Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Artificial Intelligence Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN | 3-030-19311-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Co-designing the computational model and the computing substrate -- Contributed Papers -- Generalized Membrane Systems with Dynamical Structure, Petri Nets, and Multiset Approximation Spaces -- Quantum Dual Adversary for Hidden Subgroups and Beyond -- Further Properties of Self-assembly by Hairpin Formation -- The Role of Structure and Complexity on Reservoir Computing Quality -- Lindenmayer Systems and Global Transformations -- Swarm-based multiset rewriting computing models -- DNA Origami Words and Rewriting Systems -- Computational Limitations of Affine Automata -- An Exponentially Growing Nubot System Without State Changes -- Impossibility of Sufficiently Simple Chemical Reaction Network Implementations in DNA Strand Displacement -- Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs -- Viewing rate-based neurons as biophysical conductance outputting models -- The Lyapunov Exponents of Reversible Cellular Automata Are Uncomputable -- Geometric Tiles and Powers and Limitations of Geometric Hindrance in Self-Assembly -- DNA Computing Units Based on Fractional Coding -- The role of the representational entity in physical computing -- OIM: Oscillator-based Ising Machines for Solving Combinatorial Optimisation Problems -- Relativizations of Nonuniform Quantum Finite Automata Families -- Self-stabilizing Gellular Automata. |
| Record Nr. | UNISA-996466327103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Unconventional Computation and Natural Computation : 18th International Conference, UCNC 2019, Tokyo, Japan, June 3–7, 2019, Proceedings / / edited by Ian McQuillan, Shinnosuke Seki
| Unconventional Computation and Natural Computation : 18th International Conference, UCNC 2019, Tokyo, Japan, June 3–7, 2019, Proceedings / / edited by Ian McQuillan, Shinnosuke Seki |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XX, 287 p. 247 illus., 61 illus. in color.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Numerical analysis Computer science - Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Artificial Intelligence Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN | 3-030-19311-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Co-designing the computational model and the computing substrate -- Contributed Papers -- Generalized Membrane Systems with Dynamical Structure, Petri Nets, and Multiset Approximation Spaces -- Quantum Dual Adversary for Hidden Subgroups and Beyond -- Further Properties of Self-assembly by Hairpin Formation -- The Role of Structure and Complexity on Reservoir Computing Quality -- Lindenmayer Systems and Global Transformations -- Swarm-based multiset rewriting computing models -- DNA Origami Words and Rewriting Systems -- Computational Limitations of Affine Automata -- An Exponentially Growing Nubot System Without State Changes -- Impossibility of Sufficiently Simple Chemical Reaction Network Implementations in DNA Strand Displacement -- Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs -- Viewing rate-based neurons as biophysical conductance outputting models -- The Lyapunov Exponents of Reversible Cellular Automata Are Uncomputable -- Geometric Tiles and Powers and Limitations of Geometric Hindrance in Self-Assembly -- DNA Computing Units Based on Fractional Coding -- The role of the representational entity in physical computing -- OIM: Oscillator-based Ising Machines for Solving Combinatorial Optimisation Problems -- Relativizations of Nonuniform Quantum Finite Automata Families -- Self-stabilizing Gellular Automata. |
| Record Nr. | UNINA-9910337859103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||