Regular Expression | DFA | no two consecutive letters are the same | 076

Theory of Computation, Automata Theory, gate, iit, lectures, tutorial, in hindi, Give a regular expression for the set of binary strings where every 0 is immediately followed by exactly k 1's and preceded by at least k 1’s (k is a fixed integer)
et w be the any string of length n in {0,1}∗. Let L be the set of all substrings of w. What is the minimum number of states in non-deterministic finite automation that accepts L?
regular expression in automata examples
regular expression in automata ppt
regular expression in automata theory
regular expression in automata theory ppt
regular expression examples in theory of automata
regular expressions
finite language automata theory
finite automata and formal languages