Please help me with this automata theory questions.

Q1. Suppose that in a programming language decimal, binary, octal, and hexadecimal literals can be assigned to an unsigned integer variable. Decimal literals consist of one or more digits, and do not begin with zero (O). To specify a binary literal, the prefix Ob or OB is added to the binary number. To specify an octal literal, the prefix Oc or OC is added to the octal number. To specify a hexadecimal literal, the prefix Ox or OX is added to the hexadecimal number. Any length constraint specifying the number of digits in literals should not be taken into consideration in your solution. The following are examples: (Bir programlama dilinde, iaretsiz tamsay deikenlere atanabilecek drt literal tipinin (decimal, binary, octal ve hexadecimal) olduu varsaylyor. "Decimal" literaller bir veya daha fazla rakamdan oluur ve 0 ile balamaz. "Binary" literaller Ob veya 0B ile balar. "Octal" literaller Oc veya 0C ile balar. "Hexadecimal" literaller Ox veya ox ile balar. Literallerin ka rakamdan olutuuna dair uzunluk ksn zmde dikkate alnmayacaktr. Bu tiplere ilikin rnekler aada verilmektedir.) 20, 105, 68930, are decimal literals. Ob101, 0b0101, 0B101, are binary literals. Oc5, 00367, 0e72, .. are octal literals. 0x9A4, 0xE3F, 0x87c, are hexadecimal literals. Build a deterministic finite state machine that will recognize those literals. (Bu literalleri tanyacak bir deterministik sonlu durum makinesi oluturunus.) Q2. input B output OR DELAY AND OR Draw a Mealy machine equivalent to sequential logic circuit given above. First construct a table showing state transitions and output values based on the input. Then, you can draw the machine using this table. Please show the details of logical formula calculations to get full points from this question. (Yukarda verilen ardk mantk devresinin edeeri Mealy makinesini iciniz. lk olarak, girdiye bal olarak durum geilerini ve ktlar gsteren bir tablo oluturunuz. Daha sonra bu tabloya gre izimi yapabilirsiniz. Sorudan tam puan almak iin mantk formllerini ve bunlara ilikin hesaplamalarn detayn gsteriniz. Q3. 2={0,1} and L={0*1200" | n20 } is given. Using pumping lemma, prove that language L is non-regular. Q4. a a,b a 1 a a b + 92 93 91 94 a a Convert the non-deterministic finite automata (NFA) given above into a deterministic finite automata model. Evaluation : (1)20 pts (2)40 pts 03)20 pts (4)20 pts