Register

toc fsm

• reopened by
396 views

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
0 answers
1
ankitgupta.1729 asked Feb 25, 2018
580 views
Minimization of FSM
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems ?
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems...
User Avatar
0 votes
0 votes
0 answers
2
thor asked Nov 14, 2016
192 views
FSM :
Please explain
Please explain
User Avatar
2 votes
2 votes
2 answers
3
Mojo-Jojo asked Sep 28, 2015
11,947 views
FSM
Choose the correct one - A) a FSM with 1 stack is more powerful than a FSM without stack B) a FSM with 3 stack is more powerful than a FSM with 2 stack C) a FSM with 2 stack is more powerful than a FSM with 1 stack D) both A and C
Choose the correct one -A) a FSM with 1 stack is more powerful than a FSM without stackB) a FSM with 3 stack is more powerful than a FSM with 2 stackC) a FSM with 2 stack...
User Avatar
0 votes
0 votes
1 answer
4
gateexplore asked Jun 11, 2023
453 views
TOC self doubt
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answer with explanation.
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
User Avatar
Link Copied!