Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Arbitrary CFPQ to 2-Dyck query #328

Open
2 tasks
gsvgit opened this issue Sep 12, 2018 · 0 comments
Open
2 tasks

Arbitrary CFPQ to 2-Dyck query #328

gsvgit opened this issue Sep 12, 2018 · 0 comments
Labels
CourseWork2 CourseWork3 task

Comments

@gsvgit
Copy link
Member

gsvgit commented Sep 12, 2018

  • There is an idea of how to convert arbitrary CFPQ to k-Dyck query (From arbitrary CFPQ to Dyck query).
  • 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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
CourseWork2 CourseWork3 task
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@gsvgit