|
|
 |
| |
|
|
|
Covering Relation of Lattice Valued Non-Deterministic Automaton |
|
|
|
PP: 45-49 |
|
|
|
Author(s) |
|
|
|
Namrata Kaushal,
Madhu Tiwari,
C. L. Parihar,
|
|
|
|
Abstract |
|
|
| A non-deterministic finite automaton is generalization of deterministic finite state automata. The concept of non-determinism plays an attractive role in the field of theory of computation and l-VFA defined on distributive lattices generalize some results of non-deterministic finite automaton, in this reference we have taken lattice-valued finite automata ( l-VFA) defined on distributive lattices. Using these dynamic characterization properties of such l-VFA we discuss nature of accepted language by product of two l-VFA. Moreover covering relation of l-VFA by inter relationship of two types of products also will be presented. |
|
|
|
|
|
|
|
