glucagon 发表于 2025-3-25 05:00:17

http://reply.papertrans.cn/63/6262/626114/626114_21.png

啮齿动物 发表于 2025-3-25 09:09:59

Decision problems for multi-tape automata,ape automata with or without endmarker on the one hand and the solvability resp. unsolvability of decision problems for the languages defined by the same types of automata on the other hand. The first section presents results on the inclusions between the different classes of relations and languages

Emmenagogue 发表于 2025-3-25 13:51:12

http://reply.papertrans.cn/63/6262/626114/626114_23.png

opalescence 发表于 2025-3-25 18:15:25

On the termination of simple computer programs, is considered: For simple non-nested loop-programs compile-time testable conditions are given such that the resp. programs are total (terminate for all inputs). Auxiliary tool is a global (=mathematical) semantics for infinite loop-programs whose properties are studied in detail. An application yie

Abjure 发表于 2025-3-25 22:51:17

https://doi.org/10.1007/3-540-07854-1Computer; Informatik; Processing; Text; algorithms; automata; calculus; complexity; computer science; formal

thrombus 发表于 2025-3-26 03:24:26

978-3-540-07854-8Springer-Verlag Berlin Heidelberg 1976

一夫一妻制 发表于 2025-3-26 04:30:55

Mathematical Foundations of Computer Science 1976978-3-540-38169-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

发誓放弃 发表于 2025-3-26 11:59:10

http://reply.papertrans.cn/63/6262/626114/626114_28.png

供过于求 发表于 2025-3-26 15:41:10

http://reply.papertrans.cn/63/6262/626114/626114_29.png

喧闹 发表于 2025-3-26 17:10:51

http://reply.papertrans.cn/63/6262/626114/626114_30.png
页: 1 2 [3] 4 5
查看完整版本: Titlebook: Mathematical Foundations of Computer Science 1976; 5th Symposium at Gda Antoni Mazurkiewicz Conference proceedings 1976 Springer-Verlag Ber