Register

NIELIT Scientific Assistant June 2025 | Question: 103

• recategorized by
222 views
1 1 vote

Which of the following is a property of a regular language?

  1. It cannot be represented by a finite automaton.
  2. It cannot be represented by a regular expression.
  3. It can only be represented by a context-free grammar.
  4. It is closed under union, concatenation, and Kleene star operations.

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT Scientific As...Next → · NIELIT Scientific As...
← Previous in category · NIELIT Scientific As...Next in category → · NIELIT Scientific As...
Position:
Show:

Related questions

1 1 vote
1 1 answer
202
202 views
Shubham Sharma 2 asked Jul 24, 2025
202 views
NIELIT Scientific Assistant June 2025 | Question: 64
What is the key difference between a $\text{DFA}$ (Deterministic Finite Automaton) and an $\text{NFA}$ (Nondeterministic Finite Automaton)?A $\text{DFA}$ has a single sta...
1 1 vote
1 1 answer
194
194 views
Shubham Sharma 2 asked Jul 24, 2025
194 views
NIELIT Scientific Assistant June 2025 | Question: 113
What is the main advantage of using a $\text{DFA}$ over an $\text{NFA}?$$\text{DFAs}$ are easier to construct.$\text{DFAs}$ always have fewer states than $\text{NFAs}.$$\...
0 0 votes
0 0 answers
307
307 views
Shubham Sharma 2 asked Jul 24, 2025
307 views
NIELIT Scientific Assistant June 2025 | Question: 116
Which of the following is the most powerful computational model?Finite AutomatonPush-Down AutomatonTuring MachineLinear Bounded Automaton
0 0 votes
0 0 answers
160
160 views
Shubham Sharma 2 asked Jul 24, 2025
160 views
NIELIT Scientific Assistant June 2025 | Question: 102
Which of the following is true about Turing Machines?Turing machines are equivalent to finite automataTuring machines can simulate any computation that can be described a...