Sudhir sharma has Published 951 Articles

Program to build DFA that starts and ends with ‘a’ from the input (a, b)

sudhir sharma

sudhir sharma

Updated on 06-Aug-2019 06:41:47

1K+ Views

DFA stands for Deterministic Finite Automata. It is a finite state machine that accepts or a string based on its acceptor.Here, we are going to make a DFA that accepts a string that starts and ends with a. The input is from the set (a, b). Based on this we ... Read More

Advertisements