Scholarlink

In this paper we show a series of results related to the decidability and expressive power of quantifier-free first order logical formulas containing language membership predicates (for the classes of regular and visibly push-down languages), string concatenation, letter-count and string-length functions, as well as linear integer arithmetic.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Decidability and Expressive Power of Several Theories Based on String Constraints

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Justus Greve-Kramer,
  • Tore Koß,
  • Florin Manea,
  • Timo Specht

摘要

In this paper we show a series of results related to the decidability and expressive power of quantifier-free first order logical formulas containing language membership predicates (for the classes of regular and visibly push-down languages), string concatenation, letter-count and string-length functions, as well as linear integer arithmetic.