1. Let £ = {0,1} and consider the language L of all binary strings of odd...

Question

Question

1. Let £ = {0,1} and consider the language L of all binary strings of odd length with a 0 in the middle. Give a Turing machin

engineering Computer-Science

Answer 1

Answer #1

(F 1/aik 010,R 8/8R 2 810, L olo, 1/8 o/YR tholo, ४17,R 110R 018,2 868,L OJO,R 1/IR of in На O in the to mark 1-2-3-4 blanks

Please up vote

Add a comment

Answer 2

Similar Homework Help Questions

Let L be the language of binary strings of odd length such that the middle bit...

Let L be the language of binary strings of odd length such that the middle bit is 0. Show that L is not regular, and show that L is context-free.
2. Let L = {hMi: M is a Turing machine that accepts at least two binary strings}. a) Define the notions of a recognisabl...

2. Let L = {hMi: M is a Turing machine that accepts at least two binary strings}. a) Define the notions of a recognisable language and an undecidable language. [5 marks] b) Is L Turing-recognisable? Justify your answer with an informal argument. [5 marks] c) Prove that L is undecidable. (Hint: use Rice’s theorem.) [20 marks] d) Bonus: Justify with a formal proof your answer to b). [20 marks] 2. Let L-M M): M is a Turing machine that accepts...
For a string s ∈ {0, 1} let denote the number represented by in the binary * s2 s numeral system. For example 1110 in binary has a value of 14 . Consider the language: L = {u#w | u,w ∈ {0, 1} , u } ,...

For a string s ∈ {0, 1} let denote the number represented by in the binary * s2 s numeral system. For example 1110 in binary has a value of 14 . Consider the language: L = {u#w | u,w ∈ {0, 1} , u } , * 2 + 1 = w2 meaning it contains all strings u#w such that u + 1 = w holds true in the binary system. For example, 1010#1011 ∈ L and 0011#100 ∈...

2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable...

2. Let L-M M): M is a Turing machine that accepts at least two binary strings. a) Define the notions of a recognisable language and an undecidable language. [5 marks [5 marks] b) Is L Turing-recognisable? Justify your answer with an informal argument. c) Prove that L is undecidable. (Hint: use Rice's theorem.) [20 marks] 20 marks] d) Bonus: Justify with a formal proof your answer to b). 2. Let L-M M): M is a Turing machine that accepts at...
Design a non-ambiguous grammar generating the language consisting of all binary strings, which contain an odd...

Design a non-ambiguous grammar generating the language consisting of all binary strings, which contain an odd number of 0’s and an odd number of 1’s. Justify correctness of your construction.
=(V, En) 5. Let n1 be an integer and define the graph Gn as follows {0,1}", the set of all binary strings of length...

=(V, En) 5. Let n1 be an integer and define the graph Gn as follows {0,1}", the set of all binary strings of length n. Vn = Two vertices x and y are connected by an edge emu if and only if x and y differs in exactly one position. (a) (4 points) Draw the graph Gn for n = 1,2,3 (b) (4 points) For a general n 2 1, find |Vn and |En (c) (10 points) Prove that for...

Design a Turing machine that recognizes the language L := {vSw : u, w E {0,1)" and u is a substri...

Design a Turing machine that recognizes the language L := {vSw : u, w E {0,1)" and u is a substring of u For example, 0801 E L' 10$010 E L, but i 00$10101 ¢ L. Describe the High Level algorithm informally and define the corresponding Turing Machine in details. Design a Turing machine that recognizes the language L := {vSw : u, w E {0,1)" and u is a substring of u For example, 0801 E L' 10$010 E...
4. Let = {0,1} and let A denote a language of strings that consist solely of...

4. Let = {0,1} and let A denote a language of strings that consist solely of zeroes, or ones. For example, strings 000 and 11 belong to A, whereas 11101 is not. a) Draw a state diagram of an NFA that recognizes A. b) How many states you need with an DFA to the same task?
Can you please thoroughly explain part B? Let Σ {0,1} be an alphabet. Suppose the language...

Can you please thoroughly explain part B? Let Σ {0,1} be an alphabet. Suppose the language Ly is the set of all strings that start with a 1 and L2 is the set of all strings that end in a 1. Describe Lj U L2 and (L1 UL2)* using English. b) Decide if the given strings belong to the language defined by the given regular expression. If it does not belong, then explain why. 0(1|€)10(e|0)*11 , strings: 0110011, 0100011001111

1. Use a Regular Expression to define the set of all bit strings of one or...

1. Use a Regular Expression to define the set of all bit strings of one or more 0's followed by only a 1. 2. Use a Regular Expression to define the set of all bit string of two or more symbols followed by three or more 0's. 3. Are these two grammars the same? a. S-> aSb|ab|λ b. S-> aAb|ab A->aAb|λ 4. Use the process of elimination to find the language of the following FA: (see picture for diagram) 5....