On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems


When modeling natural languages, three languages are of special interest. In natural languages, there occur phenomena like multiple agreements, crossed agreements and replication. These aspects are represented by the three languages K1 = {abc |n ≥ 1}, K2 = {abcd |m,n ≥ 1} and K3 = {ww |w ∈ {a, b}}, respectively. In the present paper, we give parallel… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics