You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There is a proof of Chomsky-Schutzenberger representation theorem which shows how to replace k-Dyck with 2-Dyck language (Theorem 10.4.3 form "Introduction to Formal Language Theory" (Addison-Wesley series in computer science) by Michael A. Harrison)
Tasks
Create an algorithm for conversion of arbitrary CFPQ to 2-Dyck query
Estimate the size of resulting graph in terms of sizes of the initial graph and initial grammar
The text was updated successfully, but these errors were encountered:
Tasks
The text was updated successfully, but these errors were encountered: