文章基本信息

标题：A Note on the P-completeness of Deterministic One-way Stack Language
作者：Klaus-Jörn Lange
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2010
卷号：16
期号：5
页码：795-799
出版社：Graz University of Technology and Know-Center
摘要：The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.