Lattice derived by double indiscernibility and computational complementarity

Yukio Gunji, Taichi Haruna, Eugene Schneider Kitamura

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

1 Citation (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

Complementarity
Equivalence relation
Chemical analysis
Upper Approximation
Automata

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

Lattice derived by double indiscernibility and computational complementarity. / Gunji, Yukio; Haruna, Taichi; Kitamura, Eugene Schneider.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5589 LNAI 2009. p. 46-51 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5589 LNAI).

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

Gunji, Y, Haruna, T & Kitamura, ES 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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5589 LNAI, pp. 46-51, 4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009, Gold Coast, QLD, 09/7/14. https://doi.org/10.1007/978-3-642-02962-2_6
Gunji Y, Haruna T, Kitamura ES. 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. 2009. p. 46-51. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02962-2_6
Gunji, Yukio ; Haruna, Taichi ; Kitamura, Eugene Schneider. / Lattice derived by double indiscernibility and computational complementarity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5589 LNAI 2009. pp. 46-51 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{26d7869735014f88806d46e902a74b26,
title = "Lattice derived by double indiscernibility and computational complementarity",
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.",
keywords = "Automata, Computational complementarity, Indiscernibility, Lattice theory",
author = "Yukio Gunji and Taichi Haruna and Kitamura, {Eugene Schneider}",
year = "2009",
doi = "10.1007/978-3-642-02962-2_6",
language = "English",
isbn = "3642029612",
volume = "5589 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "46--51",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Lattice derived by double indiscernibility and computational complementarity

AU - Gunji, Yukio

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

VL - 5589 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 46

EP - 51

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -