Some Recursively Unsolvable Problems in ALGOL-Like Languages

Er, 1961, On formal properties of simple phrase srueture grammars phonelik, Saproachwissenchaftz and Kommdbtioforschung, 14, 143

1959, On certain formal properties of grammars, Inf Contr., 2, 137, 10.1016/S0019-9958(59)90362-6

DAVis M. Compttability and Uneolvabilily. MeGraw.tIill New York (1958) DAVis M. Compttability and Uneolvabilily. MeGraw.tIill New York (1958)

GINsVBURG S. And HiBAND T N. The solvability of machine mappings of regular segs o regular sets. SDC Document 8P-772 Apr. 6 196 GINsVBURG S. And HiBAND T N. The solvability of machine mappings of regular segs o regular sets. SDC Document 8P-772 Apr. 6 196

10.1145/321127.321132

GINBURGi; S. AD ROS G.F. Operations which preserve definability in languages. To appear. GINBURGi; S. AD ROS G.F. Operations which preserve definability in languages. To appear.

PosT E. A variant of a reeursively unsolvable problem BULL. Amer. Magh. Soc. (1946) PosT E. A variant of a reeursively unsolvable problem BULL. Amer. Magh. Soc. (1946)

Sco TT, D, 1959, Finite automata and their decision problems, IBM J. Res. Dev. , (, 114