Question

a language is said to be regular iff (a) there exists a right linear regular grammar for l (b) there exists a left linear regular grammar for l (c) there exists a nfa with a single final state (d) there exists a dfa with a single final state (e) there exists a nfa without Ô‘ - move. which are true? (i) all are true (b) a, b, c are true (c) a, b, c, e are true (d) a, b, d are true

Answer 1

HOLA MATE

OPTION D IS CORRECT

Answer 2

Answer:

Explanation:

Recursively, the set of regular languages over an alphabet is defined as follows. Any language in this collection is a regular language over.

Because a DFA with numerous final states cannot be transformed to a single final state DFA.

hence option d is true.

Therefore, a language is said to be regular iff there exists a right linear regular grammar for I ,there exists a left linear regular grammar for I , there exists a dfa with a single final state.

#SPJ3