Toggle navigation
Login
Toggle navigation
JavaScript is disabled for your browser. Some features of this site may not work without it.
Polynomial-time equivalence testing for deterministic fresh-register automata
QMRO Home
School of Electronic Engineering and Computer Science
Electronic Engineering and Computer Science
Polynomial-time equivalence testing for deterministic fresh-register automata
QMRO Home
School of Electronic Engineering and Computer Science
Electronic Engineering and Computer Science
Polynomial-time equivalence testing for deterministic fresh-register automata
Browse
All of QMRO
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Administrators only
Login
Statistics
Most Popular Items
Statistics by Country
Most Popular Authors
Polynomial-time equivalence testing for deterministic fresh-register automata
View/
Open
Published version (552.5Kb)
Metadata
Show full item record
Authors
TZEVELEKOS, NP; Murawski, AS; Ramsay, SJ; Mathematical Foundations of Computer Science
URI
http://qmro.qmul.ac.uk/xmlui/handle/123456789/44616
Collections
Electronic Engineering and Computer Science
[3495]
Licence information
licensed under Creative Commons License CC-BY
Copyright statements
© Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos