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 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|