recategorized
3,546 views
1 votes
1 votes

The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is

  1. 3
  2. 4
  3. 5
  4. 6
recategorized

2 Answers

Answer:

Related questions

1 votes
1 votes
1 answer
2
go_editor asked Jul 20, 2016
1,504 views
LL grammar for the language $L = \{a^n b^m c^{n+m} \mid m \geq 0, n \geq 0\}$ is$ S \rightarrow aSc \mid S_1 ; S_1 \rightarrow bS_1c \mid \lambda$$ S \rightarrow aSc \mid...
4 votes
4 votes
3 answers
4
go_editor asked Jul 20, 2016
1,225 views
Regular expression for the language $L=w \in \{0,1\}* \mid w$ has no pair of consecutive zeros $\}$ is$(1+010)*$$(01+10)*$$(1+010)*(0+ \lambda)$$(1+01)* (0+\lambda)$