Deterministic Finite Automata (Example 1) | DFA Design Techniques | Pattern recognition problem.
HTML-код
- Опубликовано: 9 фев 2025
- Part-1 Automata Theory & Computability | Why to study Automata ?| UGC-1
• Automata Theory & Comp...
Part-2 Automata Theory & Computability | Automata prerequisite -2
• Automata Theory & Comp...
Part-3 Automata Theory | Automata Theory & Computability | power of alphabet | Cardinality --3
• Automata Theory | Auto...
Part-4 Automata Theory | Automata Theory and Computability | Classification | FA Symbols | DFA
• Automata Theory | Auto...
Part-5 Deterministic Finite Automata | Automata Theory | Language accepted by DFA
• Deterministic Finite A...
Part-7 Deterministic Finite Automata (Example-2) Automata theory | Deterministic Finite Automata | DFA
• Deterministic Finite A...
Part-8 Deterministic Finite Automata (Example 3)| Automata Theory | Theory of computation
• Deterministic Finite A...
Part-9 Deterministic Finite Automata (Example 4 )| Automata Theory | Theory of computation
• Deterministic Finite A...
Part-10 Deterministic Finite Automata (Example 5 )| Automata Theory | Theory of computation
• Deterministic Finite A...
Part-11 Deterministic Finite Automata (Example 6 ) | Automata Theory | Theory of computation
• Deterministic Finite A...
Part-12 Deterministic Finite Automata (Example 7 ) | Automata Theory | Theory of computation
• Video
nice video bro.
Super teaching sir... Please ide ತರ.... Swalpa complicated iro problem solve madi... Nam class avrigella beku
Sure , thank you
why can't it go to trap state ?
Suppuse if I give a string "aaa" it must accept if it goes to trap stat the string is not ending in final state which means string is not accepted but according to question string "aaa" must be accepted