2000 character limit reached
A Uniform Framework for Language Inclusion Problems
Published 15 Apr 2024 in cs.FL and cs.LO | (2404.09862v1)
Abstract: We present a uniform approach for solving language inclusion problems. Our approach relies on a least fixpoint characterization and a quasiorder to compare words of the "smaller" language, reducing the inclusion check to a finite number of membership queries in the "larger" language. We present our approach in detail on the case of inclusion of a context-free language given by a grammar into a regular language. We then explore other inclusion problems and discuss how to apply our approach.
- Floyd, R.W.: Syntactic analysis and operator precedence. J. ACM 10(3) (1963). https://doi.org/10.1145/321172.321179
- Istrail, S.: Generalization of the ginsburg-rice schützenberger fixed-point theorem for context-sensitive and recursive-enumerable languages. Theoretical Computer Science 18(3) (1982)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
