This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Family of lattice valued Aleshin type finite state automata
Authors
  Dr.A.Jeyanthi,  B.Stalin
Abstract
In this paper, we study Aleshin type finite automata with membership values in a lattice, which are called lattice-valued Aleshin Type finite automata. The extended subset construction of lattice-valued finite automata is introduced, then the equivalences between lattice-valued Aleshin type finite automata, lattice-valued deterministic Aleshin type finite automata and lattice-valued Aleshin type finite automata with -moves are proved. A simple characterization of lattice-valued languages recognized by lattice-valued Aleshin type finite automata.
Keywords- Aleshin type finite automata, lattice-valued deterministic Aleshin type finite automata.
Publication Details
Unique Identification Number - IJEDR1504068Page Number(s) - 432-437Pubished in - Volume 3 | Issue 4 | November 2015DOI (Digital Object Identifier) -    Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Dr.A.Jeyanthi,  B.Stalin,   "Family of lattice valued Aleshin type finite state automata", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.3, Issue 4, pp.432-437, November 2015, Available at :http://www.ijedr.org/papers/IJEDR1504068.pdf
Article Preview
|
|
||||||
|