CS computation theory about autopmata

start at Chicago time 12/7/2020 7:30AM-1.10AM
There are 16 multiple choice questions and 2 written response questions, worth 60 and 40 percent of the total grade, respectively.
The two portions of the exam will appear independently and so you may distribute your time between the two however you like. You have from 7:00 AM to 10:00 AM to complete each section.
here is the link to the book. and the question is about the knowledge in the book. ex. like what is Pumping Lemma. and is all regular expression context-free. videopohttps://drive(dot)google(dot)com/file/d/18LKcsTo1DaNn0lf5LW25mNdxWEzOlof9/view?usp=sharing test is about this https://drive(dot)google(dot)com/file/d/18LKcsTo1DaNn0lf5LW25mNdxWEzOlof9/view?usp=sharing
but for the 2 written response questions, they are as same as the exercise question in the book
I have attached EXAMPLES of the questions you will need to answer.
2 written response questions are as same as Miscellaneous Exercises in book
I HAVE PAID FOR 16 multiple - choice questions! ASK Support! -
***** the price for this order is 16 multiple choice + 2 pages of questions****
there is part of the question
True or false: the use of e-transitions expands the collection of regular sets, that is, there are sets that are recognized by a finite automaton with such transitions that are not recognized by ordinary finite automata.
True
False
True or false: every regular set of words (over any alphabet) is the range of a homomorphism that has domain {a,b}*
True
False
True or false: every DFA can be simulated by a DFA with a transition function that forbids transitions out of final states.
True
False
True or false: A language accepted by a nondeterministic finite automaton is also accepted by some deterministic finite automaton.
True
False
True or false: a finite state machine can occupy one of finitely many states; therefore the language it recognizes is finite.
True
False