Conversion of Finite Automata to Regular Expression FormulaMethod

preview_player
Показать описание
My 37th video that deals with the Conversion of Finite Automata with two states to Regular Expression Formula Method with solved examples
presented by Dr. Shyamala Devi Munisamy.
Do not forget to like, share and subscribe the channel
Рекомендации по теме
Комментарии
Автор

Thanks a lot mam.. For ur great effort..

basanaboinausharani
Автор

Explained so well.Deep understanding from your lectures, ma'am.Appreciate the work behind👌🏻👍👏🏻

preethivishwakarma
Автор

This helped me a lot ma'am! Thank you so much! 🙏❤

rakshakedlaya
Автор

11:50 Shouldn't R12 (1) be 01* instead as Regular Expressions are not commutative.

IzukuMidoriya-vlgv
Автор

Isn't the regular expression 0*1(1+0)* ?

namyalg