Subset of a language algorithm?

"Paul J. Lucas" <pjl.removethis@removethistoo.mac.com>
21 Mar 2002 22:00:31 -0500

          From comp.compilers
Related articles
Subset of a language algorithm? pjl.removethis@removethistoo.mac.com (Paul J. Lucas) (2002-03-21)
Re: Subset of a language algorithm? daw@mozart.cs.berkeley.edu (2002-03-22)
| List of all articles for this month |
From: "Paul J. Lucas" <pjl.removethis@removethistoo.mac.com>
Newsgroups: comp.compilers
Date: 21 Mar 2002 22:00:31 -0500
Organization: Prodigy Internet http://www.prodigy.com
Keywords: theory, question
Posted-Date: 21 Mar 2002 22:00:31 EST

In "Intro. to Automata Threory, Languages, and Computation," an
algorithm is given for testing whether two languages are
equivalent.


Is there an algorithm for testing whether one language accepts a
subset of another? If so, can somebody point me at it? Thanks.


- Paul




Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.