GATE CSE
First time here? Checkout the FAQ!
x
0 votes
15 views
For a string $x=a_0a_1 \ cdots a_{n-1}$ over the alphabet $\{0, 1, 2\}$, define $val(x)$ to be the value of $x$ interpreted as a ternary number, where $a_0$ is the most significant digit. More formally, $val(x)$ is given by $$ \Sigma_{0 \leq i < n} 3^{n-1-i} \cdot a_i.$$

Design a finite automaton that accepts exactly the set of strings $ x \in \{0, 1, 2\}^*$ such that $val(x)$ is divisible by 4.
asked in Others by Veteran (77.8k points)   | 15 views

Please log in or register to answer this question.



Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Arnab Bhadra

    1502 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1481 Points

  5. junaid ahmad

    1432 Points

  6. Debashish Deka

    1402 Points

  7. Rupendra Choudhary

    1230 Points

  8. rahul sharma 5

    1222 Points

  9. Arjun

    1168 Points

  10. pawan kumarln

    1164 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. pawan kumarln

    296 Points

  2. akankshadewangan24

    214 Points

  3. Arjun

    208 Points

  4. Debashish Deka

    156 Points

  5. Hira Thakur

    130 Points


23,414 questions
30,125 answers
67,509 comments
28,443 users