Prove that the set of regular languages is a proper subset of the set of the context-free languages

Posted by David Relihan on Stack Overflow See other posts from Stack Overflow or by David Relihan
Published on 2011-01-10T23:48:39Z Indexed on 2011/01/10 23:53 UTC
Read the original article Hit count: 254

Filed under:

language-theory

|

computation-theory

I was brushing up (not homework)on some computation-theory and came accross this problem:

How can you prove that the set of regular languages is a proper subset of the set of the context-free languages.

Now I know a language is regular iff it is accepted by a finite automaton.

And I know a language is context-free iff it is accepted by a pushdown automaton.

But I'm not sure of what solution is.

Related posts about language-theory

What is the exact problem with multiple inheritance?

as seen on Stack Overflow - Search for 'Stack Overflow'
I can see people asking all the time whether multiple inheritance should be included into the next version of C# or Java and C++ folks, who are fortunate enough to have this ability, say that this is like giving someone a rope to eventually hang themselves. What’s the matter with the multiple inheritance… >>> More
Theory of formal languages - Automaton

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi everybody ! I'm wondering about formal languages. I have a kind of parser : It reads à xml-like serialized tree structure and turn it into a multidimmensionnal array. I figured out that i need at least three variables to achieve the job : $tree = array(); // a new array $pTree = array(&$tree);… >>> More
How do you classify languages into regular, context free, and phrase-structure?

as seen on Stack Overflow - Search for 'Stack Overflow'
If you're given a language, how do you figure out if it's regular, CF but not regular, or phrase-structure but not CF? Is there a good way to attack this problem? I could randomly try to make FAs or PDAs, but I feel like there's a better way to do it. Classic example: L = { a^n b^n c^n | n = 0 } Where… >>> More
What exactly are administrative redexes after CPS conversion?

as seen on Stack Overflow - Search for 'Stack Overflow'
In the context of Scheme and CPS conversion, I'm having a little trouble deciding what administrative redexes (lambdas) exactly are: all the lambda expressions that are introduced by the CPS conversion only the lambda expressions that are introduced by the CPS conversion but you wouldn't have written… >>> More
Context Free Language Question (Pumping Lemma)

as seen on Stack Overflow - Search for 'Stack Overflow'
I know this isn't directly related to programming, but I was wondering if anyone know how to apply the pumping lemma to the following proof: Show that L={(a^n)(b^n)(c^m) : n!=m} is not a context free language I'm pretty confident with applying pumping lemmas, but this one is really irking me. … >>> More

Developer IT

Prove that the set of regular languages is a proper subset of the set of the context-free languages - Developer IT

Prove that the set of regular languages is a proper subset of the set of the context-free languages

language-theory

computation-theory

Related posts about language-theory

What is the exact problem with multiple inheritance?

Theory of formal languages - Automaton

How do you classify languages into regular, context free, and phrase-structure?

What exactly are administrative redexes after CPS conversion?

Context Free Language Question (Pumping Lemma)

Related posts about computation-theory

Prove that the set of regular languages is a proper subset of the set of the context-free languages

Why is this an invalid Turing machine?

What efforts exist to use programming languages to model legal code?

Categories cloud