Titlebook: Mathematical Foundations of Computer Science 1976; 5th Symposium at Gda Antoni Mazurkiewicz Conference proceedings 1976 Springer-Verlag Ber

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-25 13:51:12

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-26 03:24:26

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

只看該作者 · 發(fā)表于 2025-3-26 04:30:55

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

只看該作者 · 發(fā)表于 2025-3-26 11:59:10

只看該作者 · 發(fā)表于 2025-3-26 15:41:10

只看該作者 · 發(fā)表于 2025-3-26 17:10:51

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 05:04
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved