Related papers: On ground word problem of term equation systems

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…

In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…

We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite…

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…

This work is a study of the impact of multiple aspects in a classic unsupervised word sense disambiguation algorithm. We identify relevant factors in a decision rule algorithm, including the initial labeling of examples, the formalization…

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…

Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several…

We present a general simplification of quantified SMT formulas using variable elimination. The simplification is based on an analysis of the ground terms occurring as arguments in function applications. We use this information to generate a…

The stability of classical semi-implicit scheme, and some more advanced iterative schemes recently proposed for Numerical Weather Prediction (NWP) purpose is examined. In all these schemes, the solution of the centred-implicit non-linear…

Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present an effective semi-decision procedure for regular separability of context-free languages,…

In this paper we examine a symmetric tensor decomposition problem, the Gramian decomposition, posed as a rank minimization problem. We study the relaxation of the problem and consider cases when the relaxed solution is a solution to the…

In this thesis we use quasiorders on words to offer a new perspective on two well-studied problems from Formal Language Theory: deciding language inclusion and manipulating the finite automata representations of regular languages. First, we…

We present a new generic approach to the condensed-matter ground-state problem which is complementary to variational techniques and works directly in the thermodynamic limit. Relaxing the ground-state problem, we obtain semidefinite…

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho…