![]() ![]() After reading a, the machine can read b and can move to a state(end2). The machine can read many a’s when the machine starts. In other words, we can say that all acceptable strings(100%) that are part of the language must be accepted(100%) by finite automata machine and all rejectable strings(100%) that must not be the part of the language and are rejected (100%) by finite automata machine, then the machine is OK, otherwise machine is not OK. Invalid strings are strings that are part of the language. If any of the string that is not ending with b, and acceptable by finite automata machine, then machine is wrong and wrong machine can read the invalid strings. ![]() For example, rejectable strings are a, ba, aa,bba, abaa,abba, baba,…… and all such strings with ending letter other than b. Invalid strings are strings that are part of the language.Īll strings of the following pattern must not be accepted by the finite automata. If any of the string that is not ending with b, and acceptable by finite automata machine, then the machine is wrong and wrong machine can read the invalid strings. For example, acceptable strings are b, ab, bb,bab, aaab, abab, babb,…… and all such strings with ending letter b. Computer Science Research Topics for MS PhDįinite automata for Language of all strings ending with bĪll strings of the following pattern must be accepted by the finite automata.RegExp of strings Contains at least three 1s. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |