BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help


Deterministic Context-Free Language

Print-Friendly  Order the PDF version  Order the RTF version
About 1 pages (48 words)
Deterministic context-free language Summary

Bookmark and Share Questions on this topic? Just ask!

A Dictionary of Grammatical Terms in Linguistics

deterministic context-free language

n. (DCFL) Any one of the proper subset of context-free languages which are accepted by some deterministic pushdown automaton. Such languages have linear time recognition. The relevance of the DCFLs to natural languages has been little discussed; see Gazdar and Pullum (1985) for some comments.

This is the complete article, containing 48 words (approx. 1 page at 300 words per page).

View More Summaries on Deterministic context-free language

 
Ask any question on Deterministic context-free language and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Deterministic Context-Free Language from A Dictionary of Grammatical Terms in Linguistics. ISBN: 0-203-39336-8. Published: 2003–08–28. ©2009 Taylor and Francis. All rights reserved.



Join BookRagslearn moreJoin BookRags


About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy