OurBigBook
About
$
Donate
Sign in
Sign up
Nested two-pair count language
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
Context-free language
Nested-count context-free grammar
2026-09-29
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The language
{
a
4
r
b
5
s
c
2
s
d
3
r
:
r
,
s
≥
0
}
(1)
is
context
-
free
. The grammar
S
→
aaaa
S
ddd
∣
T
,
T
→
bbbbb
T
cc
∣
ϵ
(2)
nests the
a
,
d
dependency around the
b
,
c
dependency.
Ancestors
(7)
Nested-count context-free grammar
Context-free language
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2019
/
ii
/
Paper 1
/
4H
/
b
/
iii
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version