Cantitate/Preț
Produs

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 Restivo
en Limba Engleză Paperback – 20 iun 2005

Din seria Lecture Notes in Computer Science

Preț: 32432 lei

Preț vechi: 40541 lei
-20% Nou

Puncte Express: 486

Preț estimativ în valută:
6207 6548$ 5173£

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

Public țintă

Research

Cuprins

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