Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

6. (20 pt) Show that the following languages are not regular. (a) L = {ab i = 2;}. (b) L = {w {a,b,c}* | w

image text in transcribed

6. (20 pt) Show that the following languages are not regular. (a) L = {ab i = 2;}. (b) L = {w {a,b,c}* | w is a palindrome (i.e. w=w = wf)}

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Intelligent Information And Database Systems Second International Conference Acids Hue City Vietnam March 2010 Proceedings Part 1 Lnai 5990

Authors: Manh Thanh Le ,Jerzy Swiatek ,Ngoc Thanh Nguyen

2010th Edition

3642121446, 978-3642121449

More Books

Students also viewed these Databases questions