I am developing a work on automata and it is not clear to me the application of the stack in this one.
I did not want to go to this page because I wanted to solve my doubts by my own merit, but due to the time and complications I could not, so I would appreciate any help.
The whole problem is that I have to identify within a text file certain diseases represented by the following format.
cancer - > B ^ N D ^ 2N U ^ N H ^ 3N
diabetes - > U ^ 2N D ^ N B ^ N H ^ 2N
hepatitis - > U ^ 2N D ^ N H ^ N B ^ 3N
Example: BDDUHHH UUUUDDBBHHHH UUDHBBB DDDUUUHHB
Each of these represents the probability of a person having that disease, in this previous example there would be 25% probability of each of the diseases since there is also a word that does not belong and equal account for the total (< strong> DDDUUUHHB ), therefore there would be 4 strings with only 3 valid.
All the logic I have already solved, but not represented by the use of a battery, I will appreciate any advice, help or whatever you can tell me about it.