Author:
Bordihn Henning,Holzer Markus,Kutrib Martin
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bader, C., Moura, A.: A generalization of Ogden’s lemma. Journal of the ACM 29, 404–407 (1982)
2. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8, 315–332 (1974)
3. Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, 143–177 (1961)
4. Bordihn, H.: Context-freeness of the power of context-free languages is undecidable. Theoretical Computer Science (2003) (to appear)
5. Lecture Notes in Computer Science;T. Cachat,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献