Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht by Jan MycielskiStructures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht by Jan Mycielski

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

EditorJan Mycielski

Paperback | July 23, 1997

Pricing and Purchase Info

$125.55 online 
$141.95 list price save 11%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Structures in Logic and Computer Science: A Selection of Essays in Honor of A. EhrenfeuchtFormat:PaperbackDimensions:388 pages, 9.25 × 6.1 × 0 inPublished:July 23, 1997Publisher:Springer Berlin Heidelberg

The following ISBNs are associated with this title:

ISBN - 10:3540632468

ISBN - 13:9783540632467

Look for similar items by category:

Reviews

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.