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

粗糙

macabre

DALLY

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

過渡時(shí)期

抗體

刺穿

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

刪除

Extort

Pastry

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

打擊

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.