Some Recursively Unsolvable Problems in ALGOL-Like Languages

DOI10.1145/321150.321153MaRDI QIDQ5344171zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(8)

• 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
• The theory of languages
• The theory of languages
• Immunity and pseudorandomness of context-free languages
• New techniques for proving the decidability of equivalence problem

This page was built for publication: Some Recursively Unsolvable Problems in ALGOL-Like Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5344171)