GRAVE 发表于 2025-3-25 03:24:47

http://reply.papertrans.cn/24/2321/232038/232038_21.png

愤慨点吧 发表于 2025-3-25 10:21:47

Concatenation of program modules an algebraic approach to the semantic and implementation problems,ass are Simula-67, Smalltalk and Loglan. The structure of program modules is treated as an algebra. A concise set of algebraic axioms defining this structure is given. The addressing problem is formulated in algebraic terms. The identifier binding rule is reduced to the evaluation of terms in the al

木讷 发表于 2025-3-25 13:16:24

Regular expressions for infinite trees and a standard form of automata, that a path of a run is accepting /rejecting if for some i even/ odd, 1≤i≤2I-1, the s. appears infinitely often, and all s., j<i only finitely many times. The class of standard automata is big enough to represent all f.a. representable sets /th.1/ but has many properties similar to special automata

Sarcoma 发表于 2025-3-25 19:02:33

http://reply.papertrans.cn/24/2321/232038/232038_24.png

correspondent 发表于 2025-3-25 23:31:18

http://reply.papertrans.cn/24/2321/232038/232038_25.png

Emg827 发表于 2025-3-26 02:57:38

Mohr Circle for Infinitesimal Strainsystems, being a natural counterpart of the machinery of tilings, can be modified to cover both deterministic and alternating computations. As a by-product we present a new proof of the fact that the satisfiability problem of boolean Horn formulas is complete in PTIME.

COW 发表于 2025-3-26 05:29:39

https://doi.org/10.1007/978-1-4613-3114-8egree..We introduced the notion of functions r-distant to R. and have shown how starting from decision trees we can derive lower bounds in the model of computation trees. This relation suggests an uniform approach to lower bound proving in decision and computational tree models.

Receive 发表于 2025-3-26 08:56:03

https://doi.org/10.1007/3-540-16066-3Computation; Erfüllbarkeitsproblem der Aussagenlogik; algorithm; algorithms; automata; calculus; complexit

periodontitis 发表于 2025-3-26 13:18:10

http://reply.papertrans.cn/24/2321/232038/232038_29.png

主讲人 发表于 2025-3-26 20:14:35

http://reply.papertrans.cn/24/2321/232038/232038_30.png
页: 1 2 [3] 4 5 6
查看完整版本: Titlebook: Computation Theory; Fifth Symposium, Zab Andrzej Skowron Conference proceedings 1985 Springer-Verlag Berlin Heidelberg 1985 Computation.Erf