Please use this identifier to cite or link to this item:
Title: On the behavioral equivalence between k-data structures
Author: Martins, Manuel A.
Keywords: Behavioral equivalence
Data structures
Hidden logic
Leibniz congruence
Nerode equivalence
Automata theory
Finite automata
Formal logic
Issue Date: 2008
Publisher: Oxford University Press
Abstract: Throughout this paper we consider data structures as sorted algebras endowed with a designated subset of their visible part, which represents the set of truth values. The originality of our approach is the application of the standard abstract algebraic logic theory of deductive systems to the hidden heterogeneous case. We generalize the well-known equivalence relation between finite automata, which relies on the Nerode equivalence relation between states, to k -data structures. This is obtained via the Leibniz congruence, which can be viewed as a generalization of the Nerode equivalence in automata theory. © The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.
Peer review: yes
DOI: 10.1093/comjnl/bxm031
ISSN: 0010-4620
Appears in Collections:DMat - Artigos

Files in This Item:
File Description SizeFormat 
Comp J.pdfPreprint215.66 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.