Computer Science

regular languages

Please support our Computer Science advertiser: Learn about neural networks and artificial intelligence.

•

Join Date: Oct 2004

Posts: 4

Reputation: Den Watts is an unknown quantity at this point

Solved Threads: 0

Den Watts

Offline

Newbie Poster

regular languages

Nov 21st, 2004

I need to find the equivalence classes of the next regular language over {a,b,c}:

L={wcw^R | w belongs to {a,b}* }

any help would be apreciated !
thank you !

Den Watts, King of the world

Quick Reply to Thread

Show Printable Version

Similar Threads

how do i solve?good-bad NFA!! (Computer Science)
PHP, ASP, ColdFusion, what's your fav? (IT Professionals' Lounge)
High-Level Languages (Computer Science)
Do u use your root account on a regular basis? (*nix Software)
For those of you who need a website database! (ASP.NET)
MySQL vs. PostgreSQL (MySQL)

Other Threads in the Computer Science Forum

Previous Thread: Browser's File Interpreters
Next Thread: Graph

Thread Tools	Search this Thread
Show Printable Version Email this Page

DaniWeb Message

Cancel Changes