Some Recursively Unsolvable Problems in ALGOL-Like Languages

DOI10.1145/321150.321153zbMath0134.01302OpenAlexW1979807493MaRDI QIDQ5344171

Seymour Ginsburg, Gene F. Rose

Publication date: 1963

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321150.321153

zbMATH Keywords

mathematical logic

Related Items

The theory of languages, The theory of languages, New techniques for proving the decidability of equivalence problem, Immunity and pseudorandomness of context-free languages, The decidability of a mapping problem for generalized sequential machines with final states, Are two context-free languages translatable in a syntax-directed translation scheme?, Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari, UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES