Build a TG which accepts the language of all strings consisting of at least 4 characters such that the second-last letter is identical to the second letter. Use as few states as possible. Can anyone help?
Follow Math Help Forum on Facebook and Google+
View Tag Cloud