Scribd
Upload
41 views

Discrete Math Review Terms: Csci 435 Formal Languages and Automata

This document provides a review of key terms related to discrete math concepts including sets, relations, functions, and formal languages and automata. It defines 37 terms such as set, element, union, intersection, function, domain, range, one-to-one, onto, and equivalence relation that are important to understanding discrete structures and their relationships.

Uploaded by

rupanupal8561
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views

Discrete Math Review Terms: Csci 435 Formal Languages and Automata

This document provides a review of key terms related to discrete math concepts including sets, relations, functions, and formal languages and automata. It defines 37 terms such as set, element, union, intersection, function, domain, range, one-to-one, onto, and equivalence relation that are important to understanding discrete structures and their relationships.

Uploaded by

rupanupal8561
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CSci 435 Formal Languages and Automata

Discrete Math Review Terms


Sets Relations and Functions
1) set
2) element 20) ordered pair
3) class 21) tuple
4) intersection 22) Cartesian product
5) union 23) function
6) complement 24) relation
7) set subtraction 25) domain
8) singleton 26) range
9) empty set 27) biection !1"1 correspondence)
10) subset 28 in#erse
11) proper subset 29) total
12) disoint 30) partial
13) partition 31) one"to"one
14) po$er set 32) onto
15) cardinality 33) refle%i#e
16) countable !enumerable) 34) symmetric
17) uncountable 35) transiti#e
18) e&uinumerous 36) antisymmetric
19) c'aracteristic function 37) e&ui#alence relation

You might also like