Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.

The best answers are voted up and rise to the top

# Explore our Questions

3
1
13
views

-1
0
26
views

0
0
11
views

0
2
20
views

1
vote
0
3
views

0
0
2
views

0
0
7
views

0
1
8
views

0
2
8
views

0
1
28
views

1
vote
1
33
views

10
1
132
views
+50

0
0
4
views

0
1
27
views

0
0
9
views

0
0
4
views

0
0
5
views

0
0
6
views

0
0
8
views

0
0
25
views

0
0
6
views

-1
0
10
views

0
1
17
views

0
1
10
views

0
0
14
views

0
0
4
views

0
0
23
views

1
vote
0
35
views

0
0
20
views

0
1
10
views

1
vote
0
15
views

1
vote
1
20
views

0
0
19
views

0
0
6
views

0
0
9
views

0
1
13
views

3
0
14
views

2
0
26
views

0
0
9
views

0
0
8
views

0
0
9
views

0
0
11
views

0
0
27
views

0
0
8
views

0
0
6
views

2
1
27
views

0
0
5
views

2
0
14
views

0
0
5
views

0
0
7
views

2
0
256
views

0
0
8
views

2
0
15
views

0
0
7
views

0
0
5
views

2
0
7
views

0
0
9
views

0
1
13
views

5
1
48
views

2
0
9
views

2
0
19
views

0
0
6
views

0
0
8
views

2
0
7
views

0
1
13
views

0
1
18
views

7
0
49
views

0
0
11
views

0
0
6
views

0
0
18
views

0
0
7
views

2
1
22
views

-1
0
12
views

0
0
3
views

2
1
29
views

0
0
13
views

0
0
11
views

6
1
2k
views

7
1
63
views

0
0
2
views

0
0
6
views

0
0
6
views

0
0
4
views

0
0
11
views

1
vote
2
32
views

0
0
4
views

1
vote
1
18
views

0
0
8
views

6
0
24
views

0
0
21
views

0
1
38
views

3
1
55
views

0
2
20
views

4
0
40
views

2
0
7
views

3
0
13
views

### Automata | Proving that if $L$ is regular then $L'$ (word in $L'$ is a word from $L$ without the first and the last letter) is regular too.

Browse more Questions