Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht / Edition 1

Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht / Edition 1

ISBN-10:
3540632468
ISBN-13:
9783540632467
Pub. Date:
08/22/1997
Publisher:
Springer Berlin Heidelberg
ISBN-10:
3540632468
ISBN-13:
9783540632467
Pub. Date:
08/22/1997
Publisher:
Springer Berlin Heidelberg
Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht / Edition 1

Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht / Edition 1

Paperback

$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    Ships in 1-2 days
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

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.


Product Details

ISBN-13: 9783540632467
Publisher: Springer Berlin Heidelberg
Publication date: 08/22/1997
Series: Lecture Notes in Computer Science , #1261
Edition description: 1997
Pages: 376
Product dimensions: 6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

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.
From the B&N Reads Blog

Customer Reviews