1. Engineering
  2. Computer Science
  3. 5 10 marks an nfa in an economy of states...

Question: 5 10 marks an nfa in an economy of states...

Question details

5. [10 marks] An NFA in an Economy of States Let s E Σ-{a}*. Let l s| denote the length of string s. Construct a finite automaton in less than two dozen states that recognizes the language L = {s : gcd(Isi, 504)-6). where gcd(x, y) denotes the greatest common divisor between two numbers r, y

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution