(5 pts, 1 pt each) Define or explain the following terms: function countable set language over...

Question

Question

Answer 1

Answer #1

a)

function is a relation/rule which relates one set of data to another set

b)

countable set is a set with same cardinality as some sub set of natural numbers, the elements of countable set are always countable at a time

c)

language over an alphabet S is a set of all words generated by the rules in the grammar over S

d)

left-most derivation on a grammar G:

in left most derivation :while deriving every time the leftmost non terminal in the right hand side is expanded

e)lambda rule in grammar G: it is rule from non terminal to lambda

Answer 2

Similar Homework Help Questions

3. [20 points] Give short answers to each of the following parts. Each answer should be...

3. [20 points] Give short answers to each of the following parts. Each answer should be at most three sentences. Be sure to define any notation that you use. (a) Explain the difference between a DFA and an NFA. (b) Give a regular expression for the language consisting of strings over the alphabet 2-(0, 1) that contains an even number of 0's and an odd number of 1's and does not contain the substring 01. (c) Give the formal definition...
Problem 3. f10 points for each of the following context-free grammars, i)use set notation to define...

Problem 3. f10 points for each of the following context-free grammars, i)use set notation to define the language generated by the grammar, and ii) Show that it is ambiguous by drawing 2 different parse trees for a string. a) Grammar: S + SaSb Si S + Sja | SibT T + Tb Tac b) Grammar: S + 151 T T + 1X1 X X + 0X01
Define the following terms (1 pt each) 1.) Pseudoreplication 2.) Type I error 3.) Type Il...

Define the following terms (1 pt each) 1.) Pseudoreplication 2.) Type I error 3.) Type Il error 4.) Blinding 5.) Positive Control 6.) Negative Contro 7.) Quasi-independent Variable 8.) Intra-individual variability 9.) Inter-individual variability 10.)Post Hoc Ergo Propter Hoc 11.)Briefly describe an experiment with 2 factors, one with 2 levels, and one with 3 levels. (5 pts)

C language not C++ 1. Write the statements to do the following: (2 pts) a. Define...

C language not C++ 1. Write the statements to do the following: (2 pts) a. Define a struct with member variables width, height, topleft x, topleft y all floats). Use a tag to call it Rectangle. b. Declare a variable struct type Rectangle 2. Consider the following variables: struct int x; float y; char zi var1; union nt x; float y; char[20] z;) var2 f float and int are stored using 4 bytes each, what is the size (in bytes)...
Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of...

Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that there are no consecutive 0s, and the number of 1s is divisible by 5. Your DFA must handle all intput strings in {0,1}*. Here is a way to approach the problem: First focus only building the DFA which accepts the language: As you build your DFA, label your states with an explanation of what the state actually represents in terms...
1. (15 pts) Consider the following BNF grammar: For each of the strings below, indicate whether...

1. (15 pts) Consider the following BNF grammar: For each of the strings below, indicate whether or not the string can be derived from the grammar. ?f so, provide a derivation. (a) (5 pts) aabccd (b) (5 pts) accbcc (c) (5 pts) acccce

If you could please help with 1-3. 4 if you can but it is not necessary....

If you could please help with 1-3. 4 if you can but it is not necessary. Thanks Name: Solve problems 1-3. Problem 4 counts for extra credit. Each problem counts for 3 points. 1. Construct a non-ambiguous grammar generating the language consisting of all strings over the alphabet = {0,1,2), which contain no adjacent 1's. Provide a justification of correctness of your construction. 2. A Huffman tree constructed out of characters aj, az, az, ..., an, occurring with frequencies fi...
Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet...

Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that the number of 0s is divisible by 2 and the number of 1s is divisible by 5. Your DFA must handle all intput strings in {0,1}*. Here is a methodical way to do this: Figure out all the final states and label each with the shortest string it accepts, work backwards from these states to...
1. Define the following terms. Set Theory Sample Space Distribution Function Conditional Probability Statistical inference Prof....

1. Define the following terms. Set Theory Sample Space Distribution Function Conditional Probability Statistical inference Prof. Dr. Ahme Bayes' theoren Nev, 11, Equiprobable space Density function Normal distribution Central limit theorem