@inproceedings{7174878,
    Author = {Murawski, A.S. and Ramsay, S.J. and Tzevelekos, N.},
    BookTitle = {Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on},
    File = {Bisimilarity in Fresh-Register Automata - Murawski, Ramsay, Tzevelekos (0) (0) - a - a - n.pdf},
    ISSN = {1043-6871},
    Keywords = {bisimulation equivalence;computability;computational complexity;deterministic automata;equivalence classes;formal languages;group theory;EXPTIME-complete problem;NP-complete problem;PSPACE-problem;attacker-winning strategies;bisimilarity problem complexity;bisimulation relations;complexity class;complexity gap;computational group theory;computational scenarios;deterministic language inequivalence;deterministic register automata;duplicate values;fresh-register automata;general register assignments;infinite alphabets;name creation;no-duplicate fragment;polynomial bound;pushdown storage;register classes;register values;solvability;symmetry identification;undecidable bisimilarity;Automata;Complexity theory;Computational modeling;Games;History;Polynomials;Registers;automata over infinite alphabets;bisimilarity;computational group theory;register automata and readme},
    Month = {July},
    Pages = {156-167},
    Title = {Bisimilarity in Fresh-Register Automata},
    Year = {2015},
    bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2015.24},
    date-added = {2015-09-19 17:26:36 +0000},
    date-modified = {2015-09-19 17:28:07 +0000},
    doi = {10.1109/LICS.2015.24}
}

@inproceedings{7174878, Author = {Murawski, A.S. and Ramsay, S.J. and Tzevelekos, N.}, BookTitle = {Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on}, File = {Bisimilarity in Fresh-Register Automata - Murawski, Ramsay, Tzevelekos (0) (0) - a - a - n.pdf}, ISSN = {1043-6871}, Keywords = {bisimulation equivalence;computability;computational complexity;deterministic automata;equivalence classes;formal languages;group theory;EXPTIME-complete problem;NP-complete problem;PSPACE-problem;attacker-winning strategies;bisimilarity problem complexity;bisimulation relations;complexity class;complexity gap;computational group theory;computational scenarios;deterministic language inequivalence;deterministic register automata;duplicate values;fresh-register automata;general register assignments;infinite alphabets;name creation;no-duplicate fragment;polynomial bound;pushdown storage;register classes;register values;solvability;symmetry identification;undecidable bisimilarity;Automata;Complexity theory;Computational modeling;Games;History;Polynomials;Registers;automata over infinite alphabets;bisimilarity;computational group theory;register automata and readme}, Month = {July}, Pages = {156-167}, Title = {Bisimilarity in Fresh-Register Automata}, Year = {2015}, bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2015.24}, date-added = {2015-09-19 17:26:36 +0000}, date-modified = {2015-09-19 17:28:07 +0000}, doi = {10.1109/LICS.2015.24} }