A lower bound for the intersection of regular forests

A lower bound for the intersection of regular forests

by Volpano

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
Regular Sigma X-forests continue to play an important role in programming languages, specifically in the design of type systems. They arise naturally as terms of constructor-based, recursive data types in logic and functional languages. Deciding whether the intersection of a sequence of regular Sigma X-forests is nonempty is an important problem in type inference. We show that this problem is PSPACE-hard and as a corollary that the problem of constructing a regular Sigma X-grammar representing their intersection is PSPACE-hard. Tree automata, Computational complexity.

Discuss A lower bound for the intersection of regular forests with other readers

Join or start a book club for A lower bound for the intersection of regular forests on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for A lower bound for the intersection of regular forests?

Sign up free on Readfeed, then browse public clubs or start your own club with A lower bound for the intersection of regular forests as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss A lower bound for the intersection of regular forests with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about A lower bound for the intersection of regular forests with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.