GATE 2023 Computer Science: Find Regular Expression for DFA Language (Solved Q20)

```

Computer Sciences > GATE 2023 > Theory of Computation

Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {s,p,q,r}, with s being the start state and p being the only final state.

Which one of the following regular expressions correctly describes the language accepted by A?

A

1(0*11)*

B

0(0+1)*

C

1(0+11)*

D

1(110*)*

Correct : a

Similar Questions

Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: Which one of the fo...

#956 MCQ

Consider the context-free grammar G below: S -> aSb | X X -> aX | Xb | a | b where S and X are non-terminals, and a and b are terminal symbols. The starting non...

#974 MCQ

Consider the pushdown automaton (PDA) P below, which runs on the input alphabet {a,b}, has stack alphabet {⊥, A}, and has three states {s,p,q}, with s being the...

#975 MCQ

Related Topics

DFA regular expressions language accepted by DFA GATE Computer Sciences 2023 Deterministic Finite Automaton GATE CS 2023 Q20 Theory of Computation finite automata

Unique Visitor Count

Total Unique Visitors

Loading......