edited by
218 views
1 votes
1 votes
Construct a Turing Machine to compute the following function:

$$f(x,y) =  1 \text{  if  length(x) > length(y)} \\ =0  \text{ otherwise}{}$$

where $x$ and $y$ are strings over the alphabet set $\{a b\}$. The output should be written on the tape after a \$. For example, if input is $\$abaab\$aaba$, then output should be $\$abaab\$aaba\$1$
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
The Capricorn asked May 28, 2018
194 views
Construct a Turing Machine that computes length of a given input string. For Example, if the input is $abbaab$, the output should be $abbaab00110$.
1 votes
1 votes
0 answers
2
The Capricorn asked Apr 5, 2018
216 views
Construct a Turing Machine for the language of all strings of this form$L= \{(a^m)(b^n) \mid {\text{n is a multiple of m, and m belongs to N}\}}$
0 votes
0 votes
1 answer
3
Jeevesh asked Nov 12, 2018
967 views
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
0 votes
0 votes
1 answer
4
The Capricorn asked Apr 13, 2018
415 views
Draw PDA for ((a^m)(b^n)(a^n)(b^m)) ?