LATTICE VALUED ALESHIN TYPE AUTOMATA WITH -MOVES

  • A. Jeyanthi FACULTY, ANNA UNIVERSITY
  • V. Kalpana FACULTY, ANNA UNIVERSITY,
DOI: https://doi.org/10.53555/cse.v1i11.1309
Keywords: lattice-, valued Aleshin type lattice, valued deterministic finite automata

Abstract

The extended subset construction of lattice-valued Aleshin type finite automata
is introduced, then the equivalences between lattice-valued finite automat , latticevalued
deterministic finite automata and lattice-valued finite automata with e-moves
are proved. A simple characterization of lattice-valued languages recognized by
lattice-valued finite automata is given, then it is proved that the Kleene theorem holds
in the frame of lattice-setting. A minimization algorithm of lattice-valued
deterministic finite automata is presented. In particular, the role of the distributive law
for the truth valued domain of finite automata is analyzed: the distributive law is not
necessary to many constructions of lattice-valued finite automata, but it indeed
provides some convenience in simply processing lattice-valued finite automata

Downloads

Download data is not yet available.

Author Biographies

A. Jeyanthi, FACULTY, ANNA UNIVERSITY

REGIONAL OFFICE, MADUAI, TAMILNADU, I NDIA

V. Kalpana, FACULTY, ANNA UNIVERSITY,

FACULTY, ANNA UNIVERSITY, REGIONAL OFFICE, MADUAI, TAMILNADU, I NDIA

Published
2015-11-30
How to Cite
Jeyanthi, A., & Kalpana, V. (2015). LATTICE VALUED ALESHIN TYPE AUTOMATA WITH -MOVES. IJRDO -Journal of Computer Science Engineering, 1(11), 07-15. https://doi.org/10.53555/cse.v1i11.1309
Issue
Vol. 1 No. 11 (2015): IJRDO - Journal of Computer Science Engineering
Section
Articles

Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.