Question 3. Consider the language L = {w€ {0, 1}* | the strings 01 and 10 occur the same number of times in w}. Is this language regular or non-regular? Prove by building a DFA (if regular) or using the pumping lemma (if non-regular)

Problem 1. Consider the regular expression (0|1)*1 over the alphabet {0, 1} What language does the regular expression describe? Use the Thompson's construction method to derive a non-deterministic finite automaton (NFA) that recognizes L. It is enough to draw the final NFA Use the powerset construction method to derive an equivalent deterministic finite automaton (DFA). You must show the computation of e-closures and draw the DFA Use the partitioning method to derive an equivalent, minimal DFA. You must show the partitioning steps and draw the minimal DFA

Question 5 Let I be the set of all even length binary strings. (So I is decidable.) Give an example of a language K ⊆ I with K undecidable. Here you need to define the set K and state your reasoning why the K you define is undecidable. Full explain this question very fast solution sent me step by step text typ work only

Let L be the language L={aPb9cds | pq and q#r} over the alphabet Σ={a,b,c,d). Prove that L is not regular using the pumping lemma. Note: Follow the mathematical formalism given in the textbook. Explain your steps.