Title of article :
A Note on the P-completeness of Deterministic One-way Stack Language
Author/Authors :
Lange, Klaus-Jörn Universiy of Tübingen - WSI, Germany
Abstract :
The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
Keywords :
Automata , Grammars , Complexity classes , Completeness
Journal title :
International Journal of Universal Computer Sciences
Journal title :
International Journal of Universal Computer Sciences
