Between Regular and Context Free Languages

Welf Loewe <loewe@ipd.info.uni-karlsruhe.de>
22 Jan 1997 22:59:37 -0500

          From comp.compilers
Related articles
Between Regular and Context Free Languages loewe@ipd.info.uni-karlsruhe.de (Welf Loewe) (1997-01-22)
Re: Between Regular and Context Free Languages torbenm@diku.dk (1997-01-25)
Re: Between Regular and Context Free Languages nixon@softlab.se (Leif Nixon) (1997-01-25)
| List of all articles for this month |
From: Welf Loewe <loewe@ipd.info.uni-karlsruhe.de>
Newsgroups: comp.compilers
Date: 22 Jan 1997 22:59:37 -0500
Organization: University of Karlsruhe, Germany
Keywords: syntax, question, theory

Are there classes of languages R* with


Regular Languages \subset R* \subset context free languages


such that


L, L' \in R* ==> L \subset L' is decidable?
L, L' \in R* ==> L \subset L' is efficiently computable?


Can anyone point me to references on Dyck languages
and on (regular) tree languages. Are these classes of
languages candidates for R*?




Thanks in advance,
Welf.
--

Post a followup to this message

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