Titlebook: Mathematical Foundations of Computer Science 1984; 11th Symposium Praha M. P. Chytil,V. Koubek Conference proceedings 1984 Springer-Verlag

只看該作者 · 發(fā)表于 2025-3-23 18:23:29

A truely morphic characterization of recursively enumerable sets, 〈g,h〉 (w) = g(w) ∩ h(w) and 〈g,h〉. (w) = g.(w) ∩ h. (w). We investigate some properties of these morphic mappings and concentrate on a characterization of the recursively enumerable sets, which says: For every recursively enumerable set L there exist four homomorphisms such that L=f. ° ° f

只看該作者 · 發(fā)表于 2025-3-23 22:58:00

只看該作者 · 發(fā)表于 2025-3-24 05:33:11

只看該作者 · 發(fā)表于 2025-3-24 10:28:14

978-3-540-13372-8Springer-Verlag Berlin Heidelberg 1984

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

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

只看該作者 · 發(fā)表于 2025-3-24 20:44:16

https://doi.org/10.1007/BFb0030285Monoid; algorithms; automata; complexity; complexity theory; computability; concurrency; formal language; li

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

An investigation of controls for concurrent systems by abstract control languages,abstract languages to define behaviour and subbehaviour we are able to describe and to study different types of control rules and properties to be realized by control like deadlock avoidance, liveness and fairness.

		自動登錄	找回密碼
密碼			To register

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