CIT342 Email: bbcnoun@gmail.com Whatsapp: 08131667008 Type 2 of the Chomsky hierarchy denotes Answer: context-free language grammar is best suited for programming languages. Answer: context-free The transition function of a NFA is Answer: Î': q ><) î£ -> p(q) Consider the grammar G where N = {S,B}, Σ = {a,bfc}, S is the start symbol and P consists of the following production rules: 1. S->aBSc; 2. S -> abc; 3. Ba -> aB; 4. Bb -> bb. The grammar defines the language . Answer: l(g) = {anbncn| n â%o¥ 0 is a finite non-empty set of indivisible symbols. Answer: vocabulary is the language that consists of all words that are concatenations of 0 or more words in the original language. Answer: kleene star A formal language can be given as the following EXCEPT Answer: strings generated by a compiler. Context-free languages are closed under the following EXCEPT: Answer: intersection A FSA is nondeterministic if it is confronted with choice(s) when proceesing each character. Answer: several Every state of a Deterministic Finite Automata has exactly existing transition arrow for each symbol in the alphabet. Answer: one is used to recognize context- sensitive language. Answer: linear-bound automata (Iba) Let the alphabet Σ be the standard 26 letters {a,b,â€|,y,z}. If A = {good,bad} and B {boy,girl}, then AUB is? Answer: {good,bad,boy,girl} is a class of machines recognizing the context-free languages. Answer: pushdown automata Typical questions asked about a formal language the following EXCEPT Answer: what is their understandability? In a nondeterministic machine , choices may exist for the next state at any point. Answer: several The set of all words over an alphabet Σ usually denoted by . Answer: î£* Regular grammar is Answer: context-free grammar languages may have more than one symbols on the left hand side of their production rules (provided that at least one of them is a non-terminal). Answer: context-sensitive A formal language is a set of Answer: words A language is regular if and only if it is Answer: accepted by dfa Email: bbcnoun@gmail.com Whatsapp: 08131667008