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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
91
click to vote
IPL
1998
68
views
more
IPL 1998
»
Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
15 years 2 months ago
Download
www.cs.miami.edu
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
Burton Rosenberg
Real-time Traffic
Context-free Language
|
IPL 1998
|
Two-queue Machine
|
claim paper
Post Info
More Details (n/a)
Added
22 Dec 2010
Updated
22 Dec 2010
Type
Journal
Year
1998
Where
IPL
Authors
Burton Rosenberg
Comments
(0)
Researcher Info
IPL 2008 Study Group
Computer Vision