DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY || TOC

preview_player
Показать описание
DETERMINISTIC FINITE AUTOMATA EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY

Design DFA which accepts all strings over given alphabet where string is having
even a's and even b's
even a's and odd b's
odd a's and even b's
odd a's and odd b's

---------------------------------------------------------------------------------------------------------------
AUTOMATA THEORY || THEORY OF COMPUTATION

COMPILER DESIGN

DATABASE MANAGEMENT SYSTEM

DATA STRUCTURES

JAVA PROGRAMMING

R PROGRAMMING

HTML TUTORIALS WITH IMPLEMENTATION || LEARN HTML IN 4 HOURS

LEARN CSS IN 3 HOURS || CASCADING STYLE SHEETS FOR BEGINNERS

JAVA SCRIPT FOR BEGINNERS IN 7 HOURS || LEARN JAVA SCRIPT IN 7 HOURS || JAVA SCRIPT

XML (eXtensible Markup Language)

OPERATING SYSTEM

ETHICAL HACKING

VI EDITOR BASICS IN LINUX / UNIX || LEARN VI EDITOR COMMANDS || LINUX || UNIX

HOW TO DOWNLOAD & INSTALL MySQL IN WINDOWS 10

PYTHON PROGRAMS

C PROGRAMMING

CORE JAVA TUTORIAL FOR BEGINNERS || LEARN CORE JAVA IN 15 HOURS || JAVA TUTORIALS FOR BEGINNERS

PYTHON TUTORIALS FOR BEGINNERS (తెలుగు లో)

PYTHON OOPS - MODULES - EXCEPTION HANDLING (తెలుగు లో)

PYTHON NUMPY TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE NUMPY TUTORIALS IN TELUGU

PYTHON PANDAS TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE PANDAS TUTORIALS IN TELUGU || DATA SCIENCE

MATPLOTLIB LIBRARY - PYTHON PROGRAMMING (ENGLISH)

PYTHON DATABASE CONNECTIVITY - MYSQL & MS-EXCEL

DATA STRUCTURES USING PYTHON (ENGLISH)

----------------------------------------------------------------------------------------------
Рекомендации по теме
Комментарии
Автор

Thank you sir for the lectures, I speak north Indian English and struggle with other accents but because your teaching is so good I see this channel.

darshanjain
Автор

great lecture but there is a slight mistake, while naming OO you have given aa but you need to
give ab

naarudecode
Автор

Thank you sir ❤
I'm very grateful

favourabimbola
Автор

what about language
we should be writing the language ourselves right but the how to write it
i mean i have a question is like "design finite automata with 0, 1 as inputs accepts even no.of 0's and odd no.of 1's"
how to write language to it we can draw the graph only if we have the language right

Aashritha-ss
Автор

Q2 state ODD no. a's & ODD no. b's

thearyan
Автор

Sir if the problem is aaaabbb i mean Even no. of a's and odd no. Of b's then is it works? And if yes then how's it works?

dishaniroychowdhury
Автор

What about a machine that accepts even a's and odd b's that takes input aa? it won't reach final state in input is aa but if the input is only an odd b it will accept

LLOYDBLESSINGVHEREMU
join shbcf.ru