Problem: Write a program which generates Deterministic finite automaton which accepts given language. Language is defined with alphabet and start/end sub strings.
For example: Alphabet={a,b,c}; start sub string="ab"; end sub string="cb"
I need to construct DFA which will accept strings of kind: {abcb, abaacb, abcabcb...}.
Question: What algorithm should I use to write function which will construct DFAs for this set of problems.