Excellent		2 Reviews
Good		2 Reviews
medium		0 Reviews
Acceptable		0 Reviews
Not Good		0 Reviews

Design a Moore Machine to find 1 s Complement of a given Binary number Theory of Computation

Basic Concepts in Automata Theory Mathematical Notations TOC FLAT Theory of Computation

Sets Set Representation Set Operations power Set finite infinite subset proper

Finite Automata Model Formal Definition TOC FLAT Theory of Computation

Representation of Finite Automata Transition Diagram Transition Table TOC FLAT

What is DFA Deterministic Finite Automata FLAT TOC Theory of Computation

DFA Examples 1 2 Set of all strings Begins with a Starts with ab FLAT TOC

DFA Examples 3 4 Set of all strings Containing substring ab substring abb FLAT

DFA Examples 5 6 Set of all strings ends with ab ends with 00 FLAT Theory of computation

DFA Examples 7 Set of all strings Containing 1100 as substring FLAT Theory of computation

DFA Examples 8 9 Accepts the String 1100 Only Accepts the String 101 Only FLAT

DFA Examples 10 11 Set of all strings with Exactly One a with Exactly Two a s

DFA Examples 12 13 Set of all strings with At Least One a with At Least Two a s

DFA Examples 14 Set of all strings not Containing the sub string aab Except substring aab

DFA Examples 15 Set of all strings with Even no of a s and Even no of b s ODD NUMBER

DFA Examples 16 Set of all strings Containing the sub string ab or ba sub string 01or 10

DFA Examples 17 18 Set of all strings Starts with 1 and Ends with 0 Starts with a Ends with b

Design a DFA for Strings with 3 Consecutive 0 s Without 3 Consecutive 0 s a s b s FLAT

Design DFA to accept all Binary Strings which are divisible by 3 Three Theory of computation

Design DFA to accept all Binary Strings which are divisible by 4 Four Theory of computation

Design DFA to accept all Binary Strings which are divisible by 5 Five Theory of computation

What is NFA Non Deterministic Finite Automata FLAT TOC Theory of Computation

Differences between DFA and NFA Deterministic Finite Automata Non Deterministic Types of

NFA Examples Non Deterministic Finite Automata Theory of Computation TOC FLAT

Converting NFA to DFA Equivalence of DFA and NFA Theory of Computation TOC FLAT

converting nfa with epsilon to nfa without epsilon with example FLAT TOC Theory of Computation

Converting NFA with epsilon transitions to DFA Theory of Computation FLAT TOC

Equivalence of 2 Finite State Machines Equivalence between Two Finite Automata DFA NFA

Minimization of Finite Automata Equivalence Partition Table Filling Myhill Nerode DFA NFA

Finite Automata With Output Moore Machine Mealy Machine Theory of Computation TOC

Design a Moore Machine to find 1 s Complement of a given Binary number Theory of Computation

Moore Machine Examples Count number of occurrences of abb Print a when the sequence is 01

Moore Machine produces A as output if the input ends with 10 or B as output if input ends with 11

Design a Moore Machine to Determine residue modulo 3 of a given binary number

Design a Moore Machine to determine residue modulo 4 of a given Binary number Theory of Computation

Design a Moore Machine Construct a Examples of Theory of Computation TOC FLAT

Construct Mealy Machine that prints a whenever the sequence 01 is encountered in any input string

Design a Mealy Machine for finding 1 s complement 2 s complement Increment Binary number by 1

Conversion of Mealy Machine to Moore Machine

Conversion of Moore Machine to Mealy Machine

What is Regular Expression in Theory of Computation Automata Theory FLAT Define

Linear Algebra for Computer Scientists

Insertion Sort

Bubble Sort

GCSE Computer Science

Random Access Memory

Binary Trees

Bitwise Operators

Introduction to Stacks Data Structures

Organization Theory Structure and Design

Handling Large Scale Unit Level Data

Introduction to Machine Learning

Applied Linear Algebra Vectors Matrices

Artificial Intelligence beginners

Machine Learning Autumn 2018

Robotics and Autonomous Systems

Natural Language Understanding