Is the language $\{ 0^m10^n \mid m,n\geq1 \}$ regular?

Asked Jun 30 '17 at 06:21

Active Jul 01 '17 at 05:33

Viewed 91 times

$L = \{ 0^m10^n|m\geq1 \wedge n\geq1 \}$
Is this a regular language?

A language is regular when there is a DFA accepting the language. Since there is a DFA accepting this language I suppose that it is a regular language. But as I have seen in the book it says that it is not regular. So I am confused. Can someone guide me on this?

edited Jul 01 '17 at 05:33

Raphael

72,336
29
179
389

asked Jun 30 '17 at 06:21

Karishma

7

This language is indeed regular. This is corresponding regular expression $0^+10^+$. Which book? – fade2black Jun 30 '17 at 06:28
1

The language ${0^n10^n|n\geq1}$ isn't regular, but your language is. – Yuval Filmus Jun 30 '17 at 08:37

Is the language $\{ 0^m10^n \mid m,n\geq1 \}$ regular?

0 Answers0