Titlebook: Automata, Languages and Programming; 24th International C Pierpaolo Degano,Roberto Gorrieri,Alberto Marchett Conference proceedings 1997 Sp

脫水

減震

978-3-540-63165-1Springer-Verlag Berlin Heidelberg 1997

悶熱

采納

Debility

Tilings and quasiperiodicity,it was introduced for representing quasicrystals and it is also motivated by the study of quasiperiodic words. We prove that if a tile set can tile the plane, then it can tile the plane quasiperiodically — a surprising result that does not hold for periodicity. In order to compare the regularity of

徹底明白

單獨(dú)

ARCHE

An abstract data type for real numbers,ity of the calculus (i.e. every computable element is definable). We address the general problem of providing an operational semantics to calculi for the real numbers. We present a possible solution based on a new representation for the real numbers.

錯(cuò)

Recursive computational depth,ure. In particular, Bennett identified the classes of . and . sequences, and showed that the halting problem is strongly deep. Juedes, Lathrop, and Lutz subsequently extended this result by defining the class of . sequences, and proving that every weakly useful sequence is strongly deep..The present

最高峰