Structures in Logic and Computer Science

A Selection of Essays in Honor of A. Ehrenfeucht
1997
ISBN: 978-3-540-63246-7
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1261, 376 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1210 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Mycielski, Jan

Salomaa, Arto

Rozenberg, Grzegorz

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur

Inhaltsverzeichnis

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.