A website directory and metasearch engine of Top 20 best websites
Top 20  
Online  
 
 
Add To Favorites Make this your Start Page Top 20 from A-Z
 
Top 20 Directory
Listen to Music Now
 Classical
 Country    Jazz
 Oldies    Top 40
 Ambient    NPR
AccuRadio
Windows  |   Launch
Radio Tower  |  AOL

Top20Listen

Local Google Maps Y! AOL City Search Ticket Master Zip Phone/E-Mail
Top 20 City Guides Top 20 State Guides Top 20 Nation Guides
Metasearch Links:   
Google Yahoo MSN Ask Answers ixquick DMOZ About
Wikipedia Encarta Y! News Y! Video AV Images Blogs Top 20
 
See also Hakia Sidekiq Clusty Other Images Google ASK Flickr News Google NYT BBC
Directories Y! Google Alexa Almanac Archive Videos Google YouTube AOL MSN ASK
 
Diversions
of the week
History Facts
Dupligon
Catching Bad Guys
Poink
Draw A Cartoon Character
Archive

Top20Diversions

 
Top 20 Directory:
Top : Computers : Computer_Science : Theoretical : Formal_Language_Theory
  • Context Free Languages
  • Context Sensitive Languages
  • Recursively Enumerable Languages
  • Regular Languages

    See Also:

    Sites:
  • A Hierarchy of Languages: A brief discussion of context sensitive languages, recursively enumerable languages and languages with no grammars. Examples show these are not equivalent.
  • Formal Language Theory: An introductory approach to the topic using many examples.
  • Formal Language Theory and Parsing: This site includes chapters on regular and context-free languages as well as bottom-up and top-down parsing using LR(k) parsers.
  • Formal Language Theory for Natural Language Processing: A draft manuscript with chapters on set theory, regular languages, context free languages and the Chomsky hierarchy.
  • Grammars: A set of slides on grammars and language generation, with examples including a grammar for an abbreviated C language.
  • Grammars and Parsing: A site which describes several types of formal grammars for natural language processing, parse trees, and a number of parsing methods.
  • Grammars And Parsing: An article with examples from natural languages, parsing with YACC, the use of LL(k) grammars and the hierarchy of regular, LL(k), LR(k), context free, context sensitive and unrestricted grammars.
  • Lecture Notes: Notes for a class at Virginia Tech covering formal languages and their connections with finite automata, pushdown automata and Turing machines.
  • The Chomsky Hierarchy of Formal Grammars: A brief definition of the grammars which define the Chomsky heirarchy of families of languages.


    Listed links may put this banner on their website.

    Help build the largest human-edited directory on the web.
    Submit a Site  -  Open Directory Project  -  Become an Editor
    Terms and Conditions
    About Us
    Privacy Policy

    Processing Time: 0.01