did you get what are the stings of L ?

if you get it, then 90% of your problem solved.

check this https://gateoverflow.in/242006/regular-language-identification

The Gateway to Computer Science Excellence

0 votes

$\Large L = \left \{ a^{m^n} | n \geq 1, m > n \right \}$

What is the Minimum no.of states in a DFA which accept this language

What is the Minimum no.of states in a DFA which accept this language

0

did you get what are the stings of L ?

if you get it, then 90% of your problem solved.

check this https://gateoverflow.in/242006/regular-language-identification

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.4k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.7k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,666 questions

56,170 answers

193,841 comments

94,047 users