It is well-known that the existential theory of equations in free groups is decidable. This is a celebrated result of Makanin which was published 1982. Makanin did not discuss complexity issues, but later it was shown that ...

We study the fundamental issue of decidability of satisfiability over string logics with concatenations and finite-state transducers as atomic operations. Although restricting to one type of operations yields decidability, ...

Graph databases make use of logics that combine traditional first-order features with navigation on paths, in the same way logics for model checking do. However, modern applications of graph databases impose a new requirement ...

In this study, we analyze how 9–10-year-old pupils work with equations, a central aspect of algebraic thinking in early grades and a cornerstone for more formal learning of algebra. Specifically, we seek: (a) to describe ...

The main goal of this study is to empirically analyze a theoretical model that relates the motivating factors of purchase intent of an electronic product, in context where consumers are faced with online comments. The ...

We build a family of entire solutions to the Allen-Cahn equation in RN+1 for N >= 3, whose level set approaches the higher-dimensional catenoid in a compact region and has two logarithmic ends governed by the solutions to ...