Bisimilarity in Fresh-Register Automata
From MaRDI portal
Publication:4635800
DOI10.1109/LICS.2015.24zbMath1401.68164arXiv2005.06411MaRDI QIDQ4635800
S. J. Ramsay, Andrzej S. Murawski, Nikos Tzevelekos
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.06411
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On-the-fly bisimilarity checking for fresh-register automata ⋮ Synthesis of Data Word Transducers ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Fast computations on ordered nominal sets
This page was built for publication: Bisimilarity in Fresh-Register Automata
