The Gateway to Computer Science Excellence
0 votes
62 views
$\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
in Theory of Computation by (23 points)
edited by | 62 views
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

https://gateoverflow.in/242910/regular-grammar

1 Answer

0 votes
Best answer
here consider n=1 permanently and m=2,3,4,5,............ so it is set of all strings of length atleast 2....
by (211 points)
selected by
0
Not length ...no.of a's precisely...dfa should have 3 states then?

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,170 answers
193,841 comments
94,047 users