Cantitate/Preț
Produs

Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht: Lecture Notes in Computer Science, cartea 1261

Editat de Jan Mycielski, Grzegorz Rozenberg, Arto Salomaa
en Limba Engleză Paperback – 23 iul 1997
This book is dedicated to Andrzej Ehrenfeucht on the occasion of his 65th birthday. On personal invitation by the volume editors, 22 internationally well-known scientists from mathematical logics and theoretical computer science participated in this project honoring an excellent scientist with excellent papers centered around his scientific work.
The 22 invited papers are presented in topical sections on model theory, games and logic, graphs and algorithms, pattern matching and learning, combinatorics of words, algebra of languages, formal language theory, and computational molecular biology.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33720 lei

Preț vechi: 42149 lei
-20% Nou

Puncte Express: 506

Preț estimativ în valută:
6453 6657$ 5462£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540632467
ISBN-10: 3540632468
Pagini: 388
Ilustrații: XII, 376 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

On the work of Andrzej Ehrenfeucht in model theory.- Syntax vs. semantics on finite structures.- Expressive power of unary counters.- Some strange quantifiers.- Pebble games in model theory.- An interpretive isomorphism between binary and ternary relations.- Vagueness — A rough set view.- Ehrenfeucht games, the composition method, and the monadic theory of ordinal words.- Monadic second order logic and node relations on graphs and trees.- Approximating the volume of general Pfaffian bodies.- Complement-equivalence classes on graphs.- On compact directed acyclic word graphs.- Metric entropy and minimax risk in classification.- Of periods, quasiperiods, repetitions and covers.- Combinatorics of standard Sturmian words.- Compactness of systems of equations on completely regular semigroups.- Decision problems concerning algebraic series with noncommuting variables.- Associative shuffle of infinite words.- Constructing sequential bijections.- Rewriting rules for synchronization languages.- DNA sequence classification using DAWGs.- DNA computing: Distributed splicing systems.