HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES
1992 ◽
Vol 03
(02)
◽
pp. 181-191
◽
Keyword(s):
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.
1990 ◽
Vol 01
(03)
◽
pp. 309-323
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 53
(6)
◽
pp. 547-561
◽
2007 ◽
Vol 18
(06)
◽
pp. 1293-1302
◽
Keyword(s):
Keyword(s):
1970 ◽
Vol 16
(2)
◽
pp. 201-202
◽
2014 ◽
Vol 577
◽
pp. 917-920