union
GATE CSE & IT · Turing Machines & Computability · 1987-2012
Study anchor
Hopcroft-Ullman / Dragon Book
Automata, languages, parsing, syntax-directed translation
Practice action
Start latest PYQPYQs in this concept
All concepts →Consider the following relations A, B and C: A ID Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B ID Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C ID Phone Area 10 2200...
Let $${R_1}$$ and $${R_2}$$ be two equivalence relations on a set. Consider the following assertions: (i)$$\,\,\,\,{R_1} \cup {R_2}$$ is an euivalence relation (ii)$$\,\,\,\,{R_1}...
The probability that it will rain today is 0.5. The probability that it will rain tomorrow is 0.6. The probability that it will rain either today or tomorrow is 0.7. That is the pr...
Let $${G_1}$$ and $${G_2}$$ be subgroups of a group $$G$$. (a) Show that $${G_1}\, \cap \,{G_2}$$ is also a subgroup of $$G$$. (b) $${\rm I}$$s $${G_1}\, \cup \,{G_2}$$ always a su...
Which of the following statements is / are true / false? Union of two recursive languages is recursive
Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:
State whether the following statement are TRUE or FALSE: (a) The union of two equivalence relations is also an equivalence relation.