With Automata Theory , describe an algorithm that given two regular expressions R1 and R2 outputs YES if and only if every string generated by R1 is also generated by R2. (I.e., output YES exactly when the set of strings generated by R1 is a subset of the set of strings generated by R2.)

Exercise 2.29 Describe an algorithm that, given finite automata accepting lan- guages L1 and L2, determines if L1L2 = 0. %3D

Deterministic Finite Automata (DFA).Kindly solve correctly,will upvote you❤️

Show that the language F={M| M is a Turing machine, and L(M) contains infinite elements} is not Turing recognizable.

Find the regular expressions for the following finite automata.

Construct a deterministic two-tape Turing machine, which begins with a string of the form an on the first tape, and a string of the form am on the second tape. (n, m ∈ N.) Both heads begin scanning the left-most character of each string. The Turing machine should accept if the number n is an integer multiple of the number m; i.e. there is some integer k such that n = k · m. First, describe the algorithm that your machine uses. Then draw a transition diagram for the machine. To answer properly, your machine should handle the cases when either n or m is zero correctly.

Draw and write out the transition functions for a 2-tape Turing machine that recognizes the language {w#w|w ∈ {0, 1} ∗ }.

Let M be a Turing machine and w be a string in the input alphabet of M. Consider the problem A = {(M, w)|M moves left at some point during its computation on w} %3| Show that A is decidable.

I need 3 answers

The reverse function maps a string w to wR. Draw a multi-tape Turing machine that computes the reverse of a binary string. That is, given a binary string w as input, your Turing machine should compute wR, write the result to tape 1, and halt.