Developments in Language Theory: 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3572
Editat de Clelia De Felice, Antonio Restivoen Limba Engleză Paperback – 20 iun 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 324.32 lei
Preț vechi: 405.41 lei
-20% Nou
Puncte Express: 486
Preț estimativ în valută:
62.07€ • 65.48$ • 51.73£
62.07€ • 65.48$ • 51.73£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540265467
ISBN-10: 3540265465
Pagini: 424
Ilustrații: XII, 412 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.54 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540265465
Pagini: 424
Ilustrații: XII, 412 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.54 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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 of2-Collapsing Words.- Semi-rational Sets of DAGs.- On the Frequency of Letters in Pure Binary Morphic Sequences.
Caracteristici
Includes supplementary material: sn.pub/extras