1 option
Structures in Logic and Computer Science : A Selection of Essays in Honor of A. Ehrenfeucht / edited by Jan Mycielski, Grzegorz Rozenberg, Arto Salomaa.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1261.
- Lecture Notes in Computer Science, 0302-9743 ; 1261
- Language:
- English
- Subjects (All):
- Computers.
- Logic, Symbolic and mathematical.
- Theory of Computation.
- Mathematical Logic and Foundations.
- Local Subjects:
- Theory of Computation.
- Mathematical Logic and Foundations.
- Physical Description:
- 1 online resource (XII, 376 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69242-3
- 9783540692423
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.