Theory of Automata, Formal Languages and Computation - Study24x7
Social learning Network
Theory of Automata, Formal Languages and Computation
broucher Course Brochure
Theory of Automata, Formal Languages and Computation
by Prof Kamala Krithivasan

he theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory and languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental ca...

0.0  (0 Ratings) 0 Learner
validy img Validity Unlimited
level All Level
level English
cover Img Preview not available
Program Fee
FREE
About This Course

he theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory and languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental ca...

Show more
Course Curriculum
9 Sections | 42 Lecture | 38h 15min total length
Expand all sections
Theory of Automata, Formal Languages and Computation

Grammars: Properties of Context Free Grammars

| 06h 16min total length
  • <?php echo $alt; ?>

    GRAMMARS AND NATURAL LANGUAGE PROCESSING

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    GRAMMARS AND LANGUAGES GENERATED

    49m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    GRAMMARS AND LANGUAGES GENERATED (Contd)

    49m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    AMBIGUITY IN CFG

    57m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    SIMPLICATION OF CFG

    56m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    REMOVAL OF UNIT PRODUCTIONS , CHOMSKY NORMAL FORM FOR CFG

    56m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    GREIBACH NORMAL FORM FOR CFG

    55m <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Finite State Automata and Regular Expressions

| 10h 01min total length
  • <?php echo $alt; ?>

    FINAL STATE AUTOMATA

    45m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    NON DETERMINISTIC FSA

    45m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    NON DETERMINISTIC FSA (Contd)

    45m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    FSA WITH OUTPUT MOORE AND MEALY MACHINES

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    MINIMIZATION OF DFSA

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    MYHILL - NERODE THEOREM

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PUMPING LEMMAS FOR REGULAR SETS AND CFL

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PROBLEMS AND SOLUTIONS-I

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    DFSA TO REGULAR EXPRESSIONS

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    REGULAR EXPRESSIONS , REGULAR EXPRESSIONS TO NFSA

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    EQUIVALENCE BETWEEN FSA AND TYPE 3 GRAMMARS

    51m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    NON DETERMINISTIC FSA WITH E(Epsilon)- MOVES

    51m <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Pushdown Automata

| 03h 45min total length
  • <?php echo $alt; ?>

    PUSHDOWN AUTOMATA

    50m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PUSHDOWN AUTOMATA , EQUIVALENCE BETWEEN ACCEPTANCE BY EMPTY STORE AND ACCEPTANCE BY FINAL STATE

    58m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PUSHDOWN AUTOMATA CFG TO PDA

    58m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PUSHDOWN AUTOMATA PDA TO CFG

    58m <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Problems and Solutions

| 01h 54min total length
  • <?php echo $alt; ?>

    PROBLEMS AND SOLUTIONS-II

    50m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PROBLEMS AND SOLUTIONS - III

    1h 64 min <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Turing Machines

| 04h 46min total length
  • <?php echo $alt; ?>

    TURING MACHINES

    58m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    TURING MACHINES (Contd)

    52m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    TURING MACHINE AS ACCEPTOR , TECHNIQUES FOR TM CONSTRUCTION

    57m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    GENERALIZED VERSIONS OF TURING MACHINES

    57m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    TURING MACHINE AS A GENERATING DEVICE

    1h 60 min <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Decidability

| 03h 39min total length
  • <?php echo $alt; ?>

    RECURSIVE SETS , RECURSIVELY INNUMERABLE SETS , ENCODING OF TM , HALTING PROBLEM

    1h 60 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    PROBLEMS AND INSTANCES , UNIVERSAL TM , DECIDABILITY

    54m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    RICE'S THEOREM , LINEAR BOUNDED AUTOMATA , PROPERTIES OF TM

    54m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    POST'S CORRESPONDENCE PROBLEMS

    50m <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Introduction to Complexity Theory

| 03h 04min total length
  • <?php echo $alt; ?>

    NP - COMPLETE PROBLEMS (Contd)

    1h 61 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    NP - COMPLETE PROBLEMS , COOK'S THEOREM

    1h 61 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    POST'S CORRESPONDENCE PROBLEMS (Contd), TIME AND TAPE COMPLEXITY OT TM

    1h 61 min <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

Advanced Topics

| 02h 49min total length
  • <?php echo $alt; ?>

    REGULATED REWRITING

    56m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    L - SYSTEMS

    56m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    GRAMMAR SYSTEMS

    56m <?php echo $alt; ?>
Theory of Automata, Formal Languages and Computation

New Paradigms of Computing

| 01h 58min total length
  • <?php echo $alt; ?>

    DNA COMPUTING

    1h 62 min <?php echo $alt; ?>
  • <?php echo $alt; ?>

    MEMBRANE COMPUTING

    56m <?php echo $alt; ?>
show 6 more sections
More Courses by Prof Kamala Krithivasan

Discrete Mathematical Structures

by Prof Kamala Krithivasan
0.0 (0)

1 Enrollments

Validity Unlimited

Free