Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the equa...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Logical Methods in Computer Science e.V.
2021-10-01
|
| シリーズ: | Logical Methods in Computer Science |
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/6693/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|