A definition is requested for each of the following terms. Things like (a) AI, (b) an agent, (c) logic, and (d) the Turing test

Create a Turing Machine where the alphabet is { a b c } and L be the language of all words in which all the a's come before the b's and there are the same number of a's as b's and arbitrarily many c's that can be in front, behind, or among the a's and b's. These strings should be accepted ab abc acb cab cacbc caaccbcb caabcb ccacaabcccbccbc These strings should be rejected a b c ba bab abab abbab bbbbaab bbbbbbbbb aaaabbbbb aaabbbbaaabbbb   Handwroitten weill work.

The Sentence :   " the negation of "if p then q" is logically equivalent to "p and not q    .............................This can be restated symbolically as follows

1. Define a Turing machine over the alphabet {0, 1} that moves the input word down one symbol, and adds $ to the left-most square.

Indicate whether the following statements are True or False: a) A standard Turing machine always halts either in a final state or in a non-final state. b)When a standard Turing machine enters a final state, it will always stop. c) When a nondeterministic pushdown automaton enters a final state, it will always stop. d) Deterministic and nondeterministic pushdown automata are not equivalent. e) Pushdown automata always halt when there is no input. f) Any context-free grammar with l-free can be represented in Greibach normal form. g) Every s-grammar is unambiguous. h) Any context-free language can be parsed in linear time. i) Any string in a context-free language always has a unique leftmost derivation. j) The order to remove l-productions and unit-productions can be changed.

Computer Theory

Create a formal definition of the language that a Turing machine can understand by writing it out using the set notation.

6. Give the state diagram for a Turing machine that decides each of the following language over E = {0, 1}: a) L6= {w:w contains both the substrings 011 and 101} b) L7= {w:w contains at least two 0's and at most two 1's}