具有语法约束的（CFL）可达性：亚立方预处理、索引化权衡及结构化解码语义
Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
AI总结：
本文提出了一种基于上下文无关文法的图可达性算法框架，分析了其理论性能并进行了实证评估，揭示了文法结构和图特性对计算效率的影响。
摘要：
我们研究了在图中受上下文无关文法约束的可达性问题，重点在于复杂性和实证性能。我们提出了一种用于评估受上下文无关文法约束的可达性查询的算法框架，并分析其理论运行时间界限。为了补充我们的理论结果，我们在全面的现实世界模式基准上进行了广泛的实证评估，比较了不同的算法变体，并报告了性能权衡。我们的结果突显了文法结构和图特性对可达性计算的影响，并为实际选择高效方法提供了指导。
英文摘要：
We study the problem of grammar-constrained context-free language reachability in graphs, focusing on complexity and empirical performance. We present an algorithmic framework for evaluating reachability queries constrained by context-free grammars, and analyze its theoretical runtime bounds. To complement our theoretical results, we conduct an extensive empirical evaluation on a comprehensive benchmark of real-world schemas, comparing different algorithmic variants and reporting performance trade-offs. Our results highlight the impact of grammar structure and graph characteristics on reachability computation, and provide guidance for selecting efficient approaches in practice.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
