Lattice derived by double indiscernibility and computational complementarity

Yukio Gunji, Taichi Haruna, Eugene Schneider Kitamura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages46-51
Number of pages6
Volume5589 LNAI
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009 - Gold Coast, QLD
Duration: 2009 Jul 142009 Jul 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5589 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
CityGold Coast, QLD
Period09/7/1409/7/16

    Fingerprint

Keywords

  • Automata
  • Computational complementarity
  • Indiscernibility
  • Lattice theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Gunji, Y., Haruna, T., & Kitamura, E. S. (2009). Lattice derived by double indiscernibility and computational complementarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5589 LNAI, pp. 46-51). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5589 LNAI). https://doi.org/10.1007/978-3-642-02962-2_6