Theory of Automata and Formal Languages (3)| Formal Language Definitions (Part 1)| by Arfan Shahzad

#theoryofautomata #formallanguage The languages can be defined in different ways, such as: 1- Descriptive definition, Defined by “describing the conditions imposed on its words”. 2- Recursive definition, Define new language from the old definition of language. 3- Using Finite Automaton (FA), etc. 4- Using Regular Expression (RE), and 5- Using Transition Graph (TG) In this lecture we will discuss first two definitions of Formal Languages.