About the undecidability of program equivalence in finitary languages with state

From MaRDI portal

Revision as of 20:45, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5277737

Jump to:navigation, search

DOI10.1145/1094622.1094626zbMath1367.68024OpenAlexW1968041547MaRDI QIDQ5277737

Andrzej S. Murawski

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

game semantics program equivalence Idealized Algol

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (4)

Latent semantic analysis of game models using LSTM ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ A Fragment of ML Decidable by Visibly Pushdown Automata ⋮ Functions with local state: regularity and undecidability

This page was built for publication: About the undecidability of program equivalence in finitary languages with state

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5277737&oldid=19921583"