Intercalation Theorems for Stack Languages

  title={Intercalation Theorems for Stack Languages},
  author={William F. Ogden},
This paper develops necessary conditions for languages to be stack generable, stack decidable, and non-erasing stack generable. The result for stack generable languages shows that the languages {a<supscrpt>n</supscrpt><supscrpt>3</supscrpt>¦n≥ 0} and {a<supscrpt>n</supscrpt> b<supscrpt>n</supscrpt><supscrpt>2</supscrpt> c<supscrpt>n</supscrpt> ¦n≥0) are not stack generable. It also shows that the language {a<supscrpt>m</supscrpt> b<supscrpt>m</supscrpt><supscrpt>2</supscrpt> c<supscrpt>n… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS