(a) write a regular expression for the language A of binary strings whose length is divisible by three
(b) the language B of all binary strings that do not contain two consecutive 1's.
Where would I start?
Discrete Mathematics Basics
1) Find out if the relation R is transitive, symmetric, antisymmetric, or reflexive on the set of all web pages.where if and only if
I)Web page a has been accessed by everyone who has also accessed Web page b.
II) Both Web page a and Web page b lack any shared links.
III) Web pages a and b both have at least one shared link.
Let A, B, and C be sets. Show that