On Polynomial Recursive Sequences
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where (non)...
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if ...
On the structure of solution-sets to regular word equations
For quadratic word equations, there exists an algorithm based on rewriting rules which generates a directed graph describing all solutions to the equation. For regular word equations – those for which each variable occurs at most once on each side ...
Equation Satisfiability in Solvable Groups
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell in (Inf. Comput. 178(1), 253–262, 2002) where they showed that this problem is in P for nilpotent groups while it is NP-...
Minimum Cut in Time
The Complexity of the Distributed Constraint Satisfaction Problem
We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint. In this setting, variables and constraints are controlled by agents which communicate with each ...