Abstract
In this paper, the uvwxy-theorem of context-free languages is extended to the case of indexed languages. Applying the extended theorem, it is shown that the finiteness problem for the indexed languages is solvable and certain languages such as {anl\n^l} and {($ w)lwl |w;e {a, &}*} are not indexed languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Publications of the Research Institute for Mathematical Sciences
Paper Title
Journal
Date
