Home > BASICS Of Formal Language and automata theory

Complement Of Finite Automata : Construct The Minimal Finite Automata That Accept All The Strings Of a & b Where Every String Does Not End With ‘baa’

Construct The Minimal Finite Automata That Accept All The Strings Of a & b Where Every String Does Not End With 'baa'     States & Transitions Will Not Change While Constructing Complement Of Finite Automata¬†(M1) From Machine (M)

Read More

Day 5: Basics Of Formal Language

The Collection Of Strings We Put Some Conditions And Restrictions In The Formation Of The String Is Called As Formal Language Or The Language Which Have Proper Alphabets, Grammer And A Model To Recognize The Language Is Called As Formal Language.   The Main Motto Of This Subject Is To Study Grammer

Read More