Codex Wiki
OurBigBook.com
Site
Source code
Concatenation grammar
...
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
Formal grammar
Variable-based grammar
OurBigBook.com
Words: 147
Articles: 3
For grammars
G
=
(
Σ
,
V
,
P
,
S
)
and
G
′
=
(
Σ
,
V
′
,
P
′
,
S
′
)
with disjoint variable sets, introduce a new variable
S
0
and set
H
=
(
Σ
,
V
∪
V
′
∪
{
S
0
}
,
P
∪
P
′
∪
{
S
0
→
S
S
′
}
,
S
0
)
.
(33)
If both input grammars are variable based, then
L
(
H
)
=
L
(
G
)
L
(
G
′
)
.
Table of contents
147
3
Regular concatenation grammar
Concatenation grammar
89
1
Failure of the regular concatenation construction for a nonregular grammar
Regular concatenation grammar
42
Concatenation grammar need not be regular
Concatenation grammar
27
Ancestors
(7)
Variable-based grammar
Formal grammar
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution