Scribd Logo
Upload

Welcome to Scribd!

  • Languages and Automata

    Uploaded by

    Faheem Abdulrahiman
    2 views7 pages
    This document discusses languages and automata. It introduces four types of automata in increasing order of computational power: finite state automata (FSA), pushdown automata (PDA), linear-bounded automata (LBA), and Turing machines (TM). It notes that less powerful automata can perform the functions of more powerful ones, but not vice versa. The document also explains that regular languages are subsets of context-free languages, which in turn are subsets of context-sensitive and recursively enumerable languages based on the automata that recognize each type of language.

    Original Description:

    automata

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses languages and automata. It introduces four types of automata in increasing order of computational power: finite state automata (FSA), pushdown automata (PDA), linear-bounded automata (LBA), and Turing machines (TM). It notes that less powerful automata can perform the functions of more powerful ones, but not vice versa. The document also explains that regular languages are subsets of context-free languages, which in turn are subsets of context-sensitive and recursively enumerable languages based on the automata that recognize each type of language.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views7 pages

    Languages and Automata

    Uploaded by

    Faheem Abdulrahiman
    This document discusses languages and automata. It introduces four types of automata in increasing order of computational power: finite state automata (FSA), pushdown automata (PDA), linear-bounded automata (LBA), and Turing machines (TM). It notes that less powerful automata can perform the functions of more powerful ones, but not vice versa. The document also explains that regular languages are subsets of context-free languages, which in turn are subsets of context-sensitive and recursively enumerable languages based on the automata that recognize each type of language.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    Welcome To

    Computer Science HUB


    LANGUAGES AND AUTOMATA
    LANGUAGES AND AUTOMATA

    Type 0
    TM
    Type 1
    LBA
    Type 2
    PDA

    Type 3 FSA
    LANGUAGES AND AUTOMATA

    ❖ Every regular language is context free


    ❖ Every context free language is context sensitive
    ❖Every context sensitive language is recursively enumerable
    ▪Function carried out by FSA can also be
    carried out by PDA
    ▪Function carried out by PDA can be carried
    out by LBA, so on
    ▪Function done by all these automata can
    be done by Turing Machine
    ▪But the converse is not true.
    ▪All the functions that can be carried out by
    a TM cannot be done by a LBA and so one
    Languages and their Relation
    ▪The inclusion Relation among different languages is given by
    ▪LRL ⊂ LCF ⊂ LCS ⊂ LRE
    Thank You!!!

    You might also like