Finite automata for the language of all those strings starting and ending with different letters in theory of automata
Last modified on May 27th, 2018 at 7:57 pm
Built the FA for the language of all those strings in which all strings are starting and ending with different letters?
| Accepted Strings |
| You should check some small, some medium and some large size strings that are part of the language and all of them(100% strings) should be accepted by our FA. |
| Small strings: ab, ba, aab, abb, baa….. and all such strings that are starting and ending with different letters. |
| Medium size strings: ababab, bababbaba …… and all such strings that are starting and ending with different letters. |
| Large size strings: ababbababababbabababbabab, bababababbabbbaaaaba……. and all such strings that are starting and ending with different letters. |
| Rejected Strings |
| You should check some small, some medium and some large size strings that are not part of the language and all of them(100% strings) should be rejected by our FA. |
| Small strings: a, b, aa, bb, aba, bab….. and all such strings that are not starting and ending with different letters. |
| Medium size strings: ababab, bababbaba ……and all such strings that are not starting and ending with different letters. |
| Large size strings: ababbababababbabababbababa, bababababbabbbaaaabab…….and all such strings that are not starting and ending with different letters. |
List of All Finite Automata examples: Click Here .
 | Prof. Fazal Rehman Shamil Researcher, Publisher of International Journal Of Software Technology & Science ISSN: 2616-5325 Instructor, SEO Expert, Web Programmer and poet. Feel free to contact. |