300 views
0 votes
0 votes
What are legal strings in finite state machine ? How to identify them ?

1 Answer

Best answer
1 votes
1 votes

 If the system reads in a string, and ends up in an acceptable final state, then the string is said to be legal. If the accepted final state is not amongst the set of legal states, then the input is classified as illegal.

you can identify whether the given string accepted by FA or not by parsing the string over the FA.

for example.

given FA only accepts binary numbers that are multiples of 3. if you give 1000 thats is equivalent to 8 in decimal will not accepted by this FA so it is not legal string on the other hand if you have 1001 = (9)10 is legal

selected by

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
0 answers
2
Babaji asked Feb 9, 2019
478 views
I m getting the rank of 500 in gate 2019 and I not interested in any IIT, I wanted to go to IISc but I spoiled the exam. Now I not wanted to join IITs,plz help me will I ...
0 votes
0 votes
2 answers
3
2 votes
2 votes
1 answer
4
KingSAJ asked Feb 10, 2015
1,026 views
please provide links for PSUs selecting through GATE , specially CS branch.IOCL, powergrid, BBNL filled. aur konsa hai plz update.