consider strings with the alphabet $=\{0,1\}.$

Consider $A=\{1x1|xin{}^{**}\},$ i$.$e$.$ the language consisting of strings of length at least $2$ that start and end in $1.$ Give the state diagram of a DFA that recognizes $A.$