Question
1) Show that the language of palindromes over {0,1}*isn't regular. A palindrome is a string that reads the same forwards and backwards e.g. 110101011. 2)
1) Show that the language of palindromes over {0,1}*isn't regular. A palindrome is a string that reads the same forwards and backwards e.g. 110101011.
2) Given the result of Question 1 and a property of reqularlanguages, say why the set of non-palindromes over{0,1}*isn't regular.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Transactions On Large Scale Data And Knowledge Centered Systems Xxxviii Special Issue On Database And Expert Systems Applications Lncs 11250
Authors: Abdelkader Hameurlain ,Roland Wagner ,Sven Hartmann ,Hui Ma
1st Edition
3662583836, 978-3662583838
