![]() ![]() In case it's 2), I'll try to explain how we're representing the problem. Or the technique we're using to represent the state machine is more powerful than I think.Maybe the binary sequence is a special type of palindrome that is regular? (I'm a little fuzzy on this). ![]() But his answer surprised me, since he said that it is indeed possible and that he thinks we should be able to come up with a sotluion. I specifically asked the professor, knowing a little about CS and that palindromes aren't regular, and that a finite state machine can only detect a regular language. We were given a task to think if we can figure out a way to detect palindromes in binary sequences (no points if we do, it's just a food for thought). In my first algorithms class we're creating these patterns that are supposed to model a finite state machine. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |