Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
JUCS
2010
2010
A Note on the P-completeness of Deterministic One-way Stack Language
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
Real-time Traffic| Added | 29 Jan 2011 |
| Updated | 29 Jan 2011 |
| Type | Journal |
| Year | 2010 |
| Where | JUCS |
| Authors | Klaus-Jörn Lange |
Comments (0)
Researcher Info
|
