Affiliation:
1. Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano Via Comelico 39/41, 20135, Milano, Italy
Abstract
In this paper we give some undecidability and decidability results about context-free languages. First, we prove that the problem of deciding whether a context-free language which admits a holonomic generating function is Turing equivalent to the finiteness question for r.e. sets. Second, we show that the Equivalence Problem is decidable for a suitable class of languages, called LCLR.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献