Gurevich Abstract State Machines and Schoenhage Storage Modification Machines

dc.creatorDexter,Scott
dc.creatorDoyle,Patrick
dc.creatorGurevich,Yuri
dc.date1997
dc.date.accessioned2024-02-06T12:48:46Z
dc.date.available2024-02-06T12:48:46Z
dc.descriptionWe demonstrate that Schoenhage storage modification machines are equivalent, in a strong sense, to unary abstract state machines. We also show that if one extends the Schoenhage model with a pairing function and removes the unary restriction, then equivalence between the two machine models survives.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-003-04-0279
dc.identifierhttps://lib.jucs.org/article/27349/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7139
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 3(4): 279-303
dc.titleGurevich Abstract State Machines and Schoenhage Storage Modification Machines
dc.typeResearch Article
Файлы