Language -> Finite(Fixed number of strings) and Infinite(Infinite number of string)
L1 = Length 2 {aa,ab,ba,bb}
L2 = At least 1 a = {a ,aa ,aaa,aaa.....}
= {abba}

Automata( Model , Machine )
-> Finite Automata
->PDA
->LBA
-> Turing Machine
What is automata?
An abstract machine is called automata. It is a mathematical model , an abstract model

• Deals with the study of abstract machines and their capabilities for computation It performs computation on strings of symbols according to a set of rules . Why Computation?
• For Pattern Matching . It checks if the string belongs from this language or not .

Finite Automata in Modeling Systems :

Used in designing and checking models and electronic circuits that operate based on certain rules .
Contest Free Grammars(CFG) : Used in compiler / Programming Language design to describe syntax and natural language processing to describe structure

Building Block for Quantum Computation

Turing Machines are considered a fundamental building block for understanding quantum computation models .

Optimizing Algorithm Efficiency

Hepls classify problems based(e.g., P, NP , NP-complete and NP-hard) ,proving that some problems have no efficient solution .

Understanding Computability

Study of which problems can be solved using algorithms , essentially defining the boundaries of what a computer can calculate .

Reference :

1. GeeksforGeeks - Geek://www.geeksforgeeks.org/theory-of-computation-automata-tutorials/
2. Gate Smashers - https://www.youtube.com/watch?v=aoUEXRlvmxc&list=PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i&index=3