2 search results - page 1 / 1 » A Note on the P-completeness of Deterministic One-way Stack ... |
JUCS
2010
13 years 3 months ago
2010
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
IPL
2008
13 years 4 months ago
2008
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...