CSCI 3320 Theory of Computer
Science Questions and Correct
Answers.
regular language - Answer a language recognized by some finite state automaton
M recognizes language A - Answer A = { w | M acceptes w }
L(M) = A
(A is the language of machine M) - Answer A is the set of all strings that machine M accepts
A^k - Answer { x_1 x_2 ... x_k | x_i in A }
A ○ B - Answer { xy | x in A and y in B }
A ∪ B - Answer { x | x in A or x in B }
A^* - Answer { x_1, x_2, ..., x_k | k >= 0 and each x_i in A }
AB - Answer A ○ B
δ for nondeterministic FSA - Answer Q × Σ_ε ---> Q
- Answer
Science Questions and Correct
Answers.
regular language - Answer a language recognized by some finite state automaton
M recognizes language A - Answer A = { w | M acceptes w }
L(M) = A
(A is the language of machine M) - Answer A is the set of all strings that machine M accepts
A^k - Answer { x_1 x_2 ... x_k | x_i in A }
A ○ B - Answer { xy | x in A and y in B }
A ∪ B - Answer { x | x in A or x in B }
A^* - Answer { x_1, x_2, ..., x_k | k >= 0 and each x_i in A }
AB - Answer A ○ B
δ for nondeterministic FSA - Answer Q × Σ_ε ---> Q
- Answer
