57:
48:
41:
89:
29:
17:
33:
65:
51:
representing any context-free language by a combination of a regular language and a Dyck language
44:
about the number of words of a given length generated by an unambiguous context-free grammar
75:
led you here, you may wish to change the link to point directly to the intended article.
83:
25:
56:
68:
page lists mathematics articles associated with the same title.
24:
may refer to either of two different theorems derived by
72:
49:Chomsky–Schützenberger representation theorem
8:
42:Chomsky–Schützenberger enumeration theorem
7:
22:Chomsky–Schützenberger theorem
62:Topics referred to by the same term
14:
90:Mathematics disambiguation pages
55:
1:
106:
54:
30:Marcel-Paul Schützenberger
34:context-free languages
18:formal language theory
76:
97:
70:
59:
105:
104:
100:
99:
98:
96:
95:
94:
80:
79:
78:
77:
69:
63:
12:
11:
5:
103:
101:
93:
92:
82:
81:
66:disambiguation
61:
60:
53:
52:
45:
13:
10:
9:
6:
4:
3:
2:
102:
91:
88:
87:
85:
74:
73:internal link
67:
58:
50:
46:
43:
39:
38:
37:
35:
31:
27:
23:
19:
26:Noam Chomsky
21:
15:
32:concerning
84:Category
71:If an
20:, the
64:This
47:The
40:The
28:and
16:In
86::
36::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
