|
|
|
|
A Note on the P-completeness of Deterministic One-way Stack Language
|
|
|
|
|
|
|
|
نویسنده
|
Lange Klaus-Jörn
|
|
منبع
|
journal of universal computer science - 2010 - دوره : 16 - شماره : 5 - صفحه:795 -799
|
|
چکیده
|
The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
|
|
کلیدواژه
|
Automata ,Grammars ,Complexity classes ,Completeness
|
|
آدرس
|
Universiy of Tübingen, WSI, Germany
|
|
پست الکترونیکی
|
lange@linux.de
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|