Show simple item record

dc.contributor.authorMurawski, ASen_US
dc.contributor.authorRamsay, SJen_US
dc.contributor.authorTzevelekos, Nen_US
dc.contributor.authorIEEEen_US
dc.date.accessioned2016-07-15T09:32:33Z
dc.date.issued2015en_US
dc.date.submitted2016-06-21T13:02:07.140Z
dc.identifier.issn1043-6871en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/13504
dc.description.sponsorshipResearch supported by the Engineering and Physical Sciences Research Council (EP/J019577/1) and the Royal Academy of Engineering (RF: Tzevelekos).en_US
dc.format.extent156 - 167en_US
dc.rights“The final publication is available at http://dl.acm.org/citation.cfm?id=2876530”
dc.subjectregister automataen_US
dc.subjectbisimilarityen_US
dc.subjectcomputational group theoryen_US
dc.subjectautomata over infinite alphabetsen_US
dc.titleBisimilarity in Fresh-Register Automataen_US
dc.typeConference Proceeding
dc.identifier.doi10.1109/LICS.2015.24en_US
pubs.author-urlhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000380427100016&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6aen_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record