Exams › GATE › Technical

Which one of the following regular expressions correctly represents the language of the finite automaton given below?

1. ab*bab* + ba*aba*
2. (ab*b)*ab* + (ba*a)*ba*
3. (ab*b + ba*a)*(a* + b*)
4. (ba*a + ab*b)*(ab* + ba*)

Correct answer: (ab*b)*ab* + (ba*a)*ba*

Solution

This regular expression captures the sequences generated by the finite automaton by allowing for repetitions of 'ab*b' and 'ba*a', followed by additional 'ab*' or 'ba*' patterns, thus accurately representing the transitions and states of the automaton.

Related GATE Technical questions

• Which one of the following statements is TRUE?
• In a relational data model, which one of the following statements is TRUE?
• Consider the problem of reversing a singly linked list. To take an example, given the linked list below, head -> a -> b -> c -> d -> e -> NULL, the reversed linked list should look like head -> e -> d -> c -> b -> a -> NULL. Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
• Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot?
• Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?
• Let R1 and R2 be two 4-bit registers that store numbers in 2’s complement form. For the operation R1+R2, which one of the following values of R1 and R2 gives an arithmetic overflow?

⚔️ Practice GATE Technical free + battle 1v1 →