Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings
Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings
复制标题
语言理论的发展 - 第 27 届国际会议，DLT 2023，瑞典于默，2023 年 6 月 12-16 日，会议记录
DOI：
10.1007/978-3-031-33264-7_19
复制
发表时间：
2023
期刊：
影响因子：
--
通讯作者：
Thompson S
中科院分区：
文献类型：
--
作者：
Thompson S
是一个有限的模型变体理论的级联，扩展与定期约束。本文考虑了由其合取查询片段生成的语言FC-CQ和FC[REG]-CQ。我们比较的表达能力的各种相关的语言生成器，如正则表达式，模式和类型化模式。然后，我们考虑决策问题和，并表明某些静态分析问题（如等价性和正则性）是不可判定的。虽然本文定义的是基于逻辑的，但它同样可以被理解为模式语言的同步交叉，或者被理解为限制词方程的系统。
is a finite model variant on the theory of concatenation,extendswith regular constraints. This paper considers the languages generated by their conjunctive query fragments, FC-CQ and FC[REG]-CQ. We compare the expressive power ofto that of various related language generators, such as regular expressions, patterns, and typed patterns. We then consider decision problems forand, and show that certain static analysis problems (such as equivalence and regularity) are undecidable. While this paper definesbased on the logic, it can equally be understood as synchronized intersections of pattern languages, or as systems of restricted word equations.