000 03776nam a22005535i 4500
001 978-3-540-69242-3
003 DE-He213
005 20240423132540.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540692423
_9978-3-540-69242-3
024 7 _a10.1007/3-540-63246-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aStructures in Logic and Computer Science
_h[electronic resource] :
_bA Selection of Essays in Honor of A. Ehrenfeucht /
_cedited by Jan Mycielski, Grzegorz Rozenberg, Arto Salomaa.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aXII, 376 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1261
505 0 _aOn 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aMathematical logic.
650 1 4 _aTheory of Computation.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aMycielski, Jan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRozenberg, Grzegorz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSalomaa, Arto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540632467
776 0 8 _iPrinted edition:
_z9783662176306
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1261
856 4 0 _uhttps://doi.org/10.1007/3-540-63246-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188987
_d188987