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] ] : 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings / / edited by Clelia De Felice, Antonio Restivo
| Developments in Language Theory [[electronic resource] ] : 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings / / edited by Clelia De Felice, Antonio Restivo |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 412 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| Classificazione | 54.72 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Restricted Towers of Hanoi and Morphisms -- Collapsing Words: A Progress Report -- Locally Consistent Parsing and Applications to Approximate String Comparisons -- Central Sturmian Words: Recent Developments -- Reversible Cellular Automata -- Inexpressibility Results for Regular Languages in Nonregular Settings -- Complexity of Quantum Uniform and Nonuniform Automata -- Membership and Finiteness Problems for Rational Sets of Regular Languages -- Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells -- The Mortality Threshold for Partially Monotonic Automata -- Sturmian Words: Dynamical Systems and Derivated Words -- Schützenberger and Eilenberg Theorems for Words on Linear Orderings -- On the Membership of Invertible Diagonal Matrices -- A Kleene Theorem for Languages of Words Indexed by Linear Orderings -- Revolving-Input Finite Automata -- Some New Results on Palindromic Factors of Billiard Words -- A Note on a Result of Daurat and Nivat -- Palindromes in Sturmian Words -- Voronoi Cells of Beta-Integers -- Languages with Mismatches and an Application to Approximate Indexing -- Bidimensional Sturmian Sequences and Substitutions -- Unambiguous Morphic Images of Strings -- Complementing Two-Way Finite Automata -- On Timed Automata with Discrete Time – Structural and Language Theoretical Characterization -- Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols -- On Hairpin-Free Words and Languages -- Adding Monotonic Counters to Automata and Transition Graphs -- Polynomial Generators of Recursively Enumerable Languages -- On Language Inequalities XK???LX -- The Power of Tree Series Transducers of Type I and II -- The Inclusion Problem for Unambiguous Rational Trace Languages -- LR Parsing for Boolean Grammars -- On Some Properties of the Language of 2-Collapsing Words -- Semi-rational Sets of DAGs -- On the Frequency of Letters in Pure Binary Morphic Sequences. |
| Record Nr. | UNISA-996465828403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Developments in language theory : 9th international conference, DLT 2005, Palermo, Italy, July 4-8, 2005 : proceedings / / Clelia De Felice, Antonio Restivo (eds.)
| Developments in language theory : 9th international conference, DLT 2005, Palermo, Italy, July 4-8, 2005 : proceedings / / Clelia De Felice, Antonio Restivo (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XII, 412 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
De FeliceClelia
RestivoAntonio |
| Collana | Lecture notes in computer science |
| Soggetto topico | Formal languages |
| Classificazione | 54.72 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Restricted Towers of Hanoi and Morphisms -- Collapsing Words: A Progress Report -- Locally Consistent Parsing and Applications to Approximate String Comparisons -- Central Sturmian Words: Recent Developments -- Reversible Cellular Automata -- Inexpressibility Results for Regular Languages in Nonregular Settings -- Complexity of Quantum Uniform and Nonuniform Automata -- Membership and Finiteness Problems for Rational Sets of Regular Languages -- Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells -- The Mortality Threshold for Partially Monotonic Automata -- Sturmian Words: Dynamical Systems and Derivated Words -- Schützenberger and Eilenberg Theorems for Words on Linear Orderings -- On the Membership of Invertible Diagonal Matrices -- A Kleene Theorem for Languages of Words Indexed by Linear Orderings -- Revolving-Input Finite Automata -- Some New Results on Palindromic Factors of Billiard Words -- A Note on a Result of Daurat and Nivat -- Palindromes in Sturmian Words -- Voronoi Cells of Beta-Integers -- Languages with Mismatches and an Application to Approximate Indexing -- Bidimensional Sturmian Sequences and Substitutions -- Unambiguous Morphic Images of Strings -- Complementing Two-Way Finite Automata -- On Timed Automata with Discrete Time – Structural and Language Theoretical Characterization -- Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols -- On Hairpin-Free Words and Languages -- Adding Monotonic Counters to Automata and Transition Graphs -- Polynomial Generators of Recursively Enumerable Languages -- On Language Inequalities XK???LX -- The Power of Tree Series Transducers of Type I and II -- The Inclusion Problem for Unambiguous Rational Trace Languages -- LR Parsing for Boolean Grammars -- On Some Properties of the Language of 2-Collapsing Words -- Semi-rational Sets of DAGs -- On the Frequency of Letters in Pure Binary Morphic Sequences. |
| Altri titoli varianti | DLT 2005 |
| Record Nr. | UNINA-9910484779903321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Computer Science [[electronic resource] ] : 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001. Proceedings / / edited by Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi
| Theoretical Computer Science [[electronic resource] ] : 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001. Proceedings / / edited by Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 448 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Data structures (Computer science) Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Data Structures |
| ISBN | 3-540-45446-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A LTS Semantics of Ambients via Graph Synchronization with Mobility -- Filter Models and Easy Terms -- Confluence of Untyped Lambda Calculus via Simple Types -- Incremental Inference of Partial Types -- Call-by-Value Separability and Computability -- Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms -- Job Shop Scheduling Problems with Controllable Processing Times -- Upper Bounds on the Size of One-Way Quantum Finite Automata -- P Systems with Gemmation of Mobile Membranes -- Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots -- Some Structural Properties of Associative Language Descriptions -- Block-Deterministic Regular Languages -- Constructing Finite Maximal Codes from Schützenberger Conjecture -- An Effective Translation of Fickle into Java -- Subtyping and Matching for Mobile Objects -- On Synchronous and Asynchronous Communication Paradigms -- Complexity of Layered Binary Search Trees with Relaxed Balance -- Distance Constrained Labeling of Precolored Trees -- Exponentially Decreasing Number of Operations in Balanced Trees -- Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach -- Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold -- Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions -- On the Distribution of a Key Distribution Center -- Online Advertising: Secure E-coupons -- A Calculus and Complexity Bound for Minimal Conditional Logic -- Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach -- E-unifiability via Narrowing. |
| Record Nr. | UNISA-996465783203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science : 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001. Proceedings / / edited by Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi
| Theoretical Computer Science : 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001. Proceedings / / edited by Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 448 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Data structures (Computer science) Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Data Structures |
| ISBN | 3-540-45446-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A LTS Semantics of Ambients via Graph Synchronization with Mobility -- Filter Models and Easy Terms -- Confluence of Untyped Lambda Calculus via Simple Types -- Incremental Inference of Partial Types -- Call-by-Value Separability and Computability -- Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms -- Job Shop Scheduling Problems with Controllable Processing Times -- Upper Bounds on the Size of One-Way Quantum Finite Automata -- P Systems with Gemmation of Mobile Membranes -- Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots -- Some Structural Properties of Associative Language Descriptions -- Block-Deterministic Regular Languages -- Constructing Finite Maximal Codes from Schützenberger Conjecture -- An Effective Translation of Fickle into Java -- Subtyping and Matching for Mobile Objects -- On Synchronous and Asynchronous Communication Paradigms -- Complexity of Layered Binary Search Trees with Relaxed Balance -- Distance Constrained Labeling of Precolored Trees -- Exponentially Decreasing Number of Operations in Balanced Trees -- Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach -- Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold -- Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions -- On the Distribution of a Key Distribution Center -- Online Advertising: Secure E-coupons -- A Calculus and Complexity Bound for Minimal Conditional Logic -- Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach -- E-unifiability via Narrowing. |
| Record Nr. | UNINA-9910767576103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||