Abstract
In this paper, the concept of a node in a lattice introduced by J.Duda has been extended to trellises, a non- associative generalization of a lattice.It is proved that set of all nodes of a trellis forms a distributive lattice. Also we have proved that node of a trellis is standard if and only if it is not contained in a non trivial cycle.
Highlights
A reflexive and antisymmetric binary relation on a set A is called a pseudoorder on A and A, is called a pseudo-ordered set or a psoset.For a, b ∈ A if a b and a = b, we write a ⊳ b
The empty set and a single element set in a psoset are cycles
An element d of a psoset A is called a node if d is middle transitive and comparable with every element of A
Summary
A non-trivial cycle contains at least three elements. A psoset is said to be acyclic if it does not contain any non-trivial cycle. Y, d of a trellis L, d is said to be: i. An element d of a psoset A is called a node if d is middle transitive and comparable with every element of A.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
