closed by
479 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2003 | Question: 50

closed by

Related questions

2 votes
2 votes
1 answer
1
Mojo-Jojo asked Sep 28, 2015
1,605 views
Let M be a Non-deterministic Finite Machine. Let G be the Regular Grammar obtained from M. Which is True?(a) G will always be unambiguous(b) G will always be ambiguous(c)...
0 votes
0 votes
1 answer
3
Mizuki asked Nov 14, 2018
1,048 views
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?Please elaborate.