AUTOMATA : Chapter 1
Across
- 1. Principle stating the total number of subsets for a set
- 4. The set resulting from the collection of all possible ordered pairs of a given set
- 5. Type of set where the order of elements matters
- 6. The set of elements in one set but not in another
- 8. The rule that a member of a set cannot also be the set itself
- 11. A set that contains all possible elements of interest
- 13. Set containing no elements
- 14. Difference: Operation between two sets that returns elements present in both, exclusively
- 15. Set: A set of all subsets of a set
- 16. Logical statement that two sets have no elements in common
- 17. A set operation that combines all elements unique to each set
- 18. The set of all elements that are in either of two sets
Down
- 1. Method used to prove the equality of two sets
- 2. Notation used to express the number of elements in a set
- 3. A diagram that shows all possible logical relations between a finite collection of sets
- 7. The set of elements common to two sets
- 9. Collection of distinct objects considered as a whole
- 10. An object or element belonging to a set
- 12. Relation showing how elements from two sets correspond to one another
- 14. A set that is entirely contained within another set