Affiliation:
1. University of Calgary, Department of Mathematics, Calgary, Alberta, Canada
Abstract
A direct and self-contained proof is given of the inherent ambiguity of the context-free language
L
= {
a
i
b
i
c
i
∣
i,j
> 1} ∪ {
a
i
b
i
c
i
∣
i,j
> 1}, which is the solution to an open problem pointed out by Ginsburg.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献