TY - GEN
T1 - Lattice derived by double indiscernibility and computational complementarity
AU - Gunji, Yukio Pegio
AU - Haruna, Taichi
AU - Kitamura, Eugene Schneider
PY - 2009
Y1 - 2009
N2 - We here concentrate on equivalence relation, and show that the composition of upper approximation of one equivalence relation and the lower one of the other equivalence relation can form a lattice. We also show that this method can be used to define computational complementarity in automata.
AB - We here concentrate on equivalence relation, and show that the composition of upper approximation of one equivalence relation and the lower one of the other equivalence relation can form a lattice. We also show that this method can be used to define computational complementarity in automata.
KW - Automata
KW - Computational complementarity
KW - Indiscernibility
KW - Lattice theory
UR - http://www.scopus.com/inward/record.url?scp=69049111100&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=69049111100&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02962-2_6
DO - 10.1007/978-3-642-02962-2_6
M3 - Conference contribution
AN - SCOPUS:69049111100
SN - 3642029612
SN - 9783642029615
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 46
EP - 51
BT - Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings
T2 - 4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
Y2 - 14 July 2009 through 16 July 2009
ER -