Problem Statement: Write a C program to recognize strings under 'a*", 'a*b+', 'abb'. AIM: Identify strings from the input strings. ALGORITHM / PROCEDURE: By using transition diagram we verify input of the state. If the state recognize the given pattern rule. Then print string is accepted under a*/ a*b+/ abb. Else print string not accepted.

Generate a constrained Regular Expression for the language that is described by the following:   1)  all strings MUST begin with at least one 'a' character 2)  all strings MUST end with EXACTLY one 'a' 3)  between the 'a' characters are an unknown number of 'b', 'c', and 'd' characters. 4)  the number of 'c' characters are at least one. 5)  the number of 'b' characters is exactly the same as the number of 'd' characters.

Please help me solve this problem C. Chess Boundary Positions: Write a program called chess_pos.py On a chessboard, positions are marked with letters between a and h for the column and a number between 1 and 8 for the row. Give a 2 character input string with a letter (a-h) and a number (1-8), print "Corner" if the value indicates a square on a corner. Print "Border" if the value indicates a square on an edge of the board. Otherwise, print "Inside".