CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
Alexander Meduna (Department of Information Systems, Faculty of, Information Technology, Brno University of Technology), Jakub Marti\v{s}ko, (Department of Information Systems, Faculty of Information Technology, Brno, University of Technology)
TL;DR
This paper characterizes the family of context sensitive languages using two-component CD grammar systems with propagating scattered context rules, addressing the equivalence problem between propagating scattered context grammars and context sensitive grammars.
Contribution
It reformulates the L(PSCG)=L(CS) problem within the framework of CD grammar systems, providing a new characterization of context sensitive languages.
Findings
Characterizes context sensitive languages with two-component CD grammar systems
Provides a solution to the L(PSCG)=L(CS) equivalence problem
Establishes a new formal framework for scattered context grammars
Abstract
The L(PSCG)=L(CS) problem asks whether propagating scattered context grammars and context sensitive grammars are equivalent. The presented paper reformulates and answers this problem in terms of CD grammar systems. More specifically, it characterizes the family of context sensitive languages by two-component CD grammar systems with propagating scattered context rules.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.