Register

Theory Of Computation (NFA/DFA)

351 views
0 votes
0 votes

**MSQ**

The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)

  1. 0
  2. 1
  3. 01
  4. 10
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
amarkaswan asked Oct 12, 2016
293 views
Theory of Computation (DFA & NFA)
1) if |L1| < |L2| then L1 must be finite Trye/False?
1) if |L1| < |L2| then L1 must be finite Trye/False?
User Avatar
0 votes
0 votes
1 answer
2
jenny101 asked Dec 6, 2016
482 views
nfa theory of computation
The answer to this question is given as 6.
The answer to this question is given as 6.
User Avatar
0 votes
0 votes
1 answer
3
aditi19 asked Dec 14, 2018
1,333 views
Conversion of NFA to DFA
convert the following NFA to DFA
convert the following NFA to DFA
User Avatar
Link Copied!