Scribd Logo
Upload

Welcome to Scribd!

  • 527 views

    9789386668516

    Uploaded by

    Amshula Amshu
    The document describes a book about finite automata and formal languages. The book covers topics like DFAs, NFAs, regular expressions, regular languages, context-free grammars, pushdown automata and Turing machines. It includes 348 pages across 11 chapters and uses a simple approach to help students understand the subject well.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    9789386668516

    Uploaded by

    Amshula Amshu
    527 views2 pages
    The document describes a book about finite automata and formal languages. The book covers topics like DFAs, NFAs, regular expressions, regular languages, context-free grammars, pushdown automata and Turing machines. It includes 348 pages across 11 chapters and uses a simple approach to help students understand the subject well.

    Original Description:

    Fafl txt book description

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a book about finite automata and formal languages. The book covers topics like DFAs, NFAs, regular expressions, regular languages, context-free grammars, pushdown automata and Turing machines. It includes 348 pages across 11 chapters and uses a simple approach to help students understand the subject well.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    527 views2 pages

    9789386668516

    Uploaded by

    Amshula Amshu
    The document describes a book about finite automata and formal languages. The book covers topics like DFAs, NFAs, regular expressions, regular languages, context-free grammars, pushdown automata and Turing machines. It includes 348 pages across 11 chapters and uses a simple approach to help students understand the subject well.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Book Title:-Finite Automata and Formal Languages

    Author :-A.M. Padma Reddy

    ISBN :-9789386668516

    Price :-INR 350

    Pages :-348

    Edition :-1

    Binding :-Paperback

    Imprint :-CL India

    © Year :-2019

    Overview :

    This book, Finite Automata and Formal Languages (A Simple Approach), includes various concepts
    pertaining to theoretical foundation of Computer Science, such as Finite Automata (DFA and NFA), Regular
    expressions and regular languages, Properties of regular languages, Context-free grammar, Properties of
    context-free grammar, Pushdown Automata, and Turing machines in a systematic manner which makes the
    study of this subject much easier and interesting as well. A new problem-solving approach is used, which
    helps to tackle more number of problems. The book is written using simple language and more number of
    applications and problems have been covered so that any student can understand the subject very well.

    Table Of Content :

    1. Why Theory of Computations &amp Languages and Strings

    2. Language Hierarchy, Computation &amp Finite State Machines

    3. &epsilon-NFA, Minimization

    4. Regular Expressions

    5. Regular Grammars &amp Regular Languages

    6. Regular Languages &amp Properties of Regular Languages

    7. Context-free Grammars &amp Languages

    8. Pushdown Automata

    9. Properties of CFLs

    10. Turing Machines


    11. Decidability and Complexity

    You might also like