ON SERIALIZABLE LANGUAGES
From MaRDI portal
Publication:4853330
DOI10.1142/S0129054194000177zbMath0830.68049OpenAlexW2077272300MaRDI QIDQ4853330
Publication date: 28 January 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054194000177
Related Items
Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria ⋮ Universally serializable computation