Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
GATE | CS | 2022 | TOC | Finite Automata | Question 12
Last Updated :
Discuss
Comments
Which one of the following regular expressions correctly represents the language of the finite automaton given below
ab*bab* + ba*aba*
(ab*b)*ab* + (ba*a)*ba*
(ab*b+ba*a)*(a*+b*)
(ba*a+ ab*b)* (ab* + ba*)
This question is part of this quiz :
Regular languages and finite automata,GATE CS 2022,Finite Automata PYQ QUIZ GATE CSShare your thoughts in the comments
GeeksforGeeks