Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
JUCS
2010
favorite
Email
discuss
report
112
views
more
JUCS 2010
»
A Note on the P-completeness of Deterministic One-way Stack Language
13 years 11 months ago
Download
www.jucs.org
: The membership problems of both stack automata and nonerasing stack automata are shown to be complete for polynomial time.
Klaus-Jörn Lange
Real-time Traffic
JUCS 2010
|
Polynomial Time
|
Stack Automata
|
claim paper
Post Info
More Details (n/a)
Added
29 Jan 2011
Updated
29 Jan 2011
Type
Journal
Year
2010
Where
JUCS
Authors
Klaus-Jörn Lange
Comments
(0)
Researcher Info
JUCS 2000 Study Group
Computer Vision