Sökning: "automaton invariants"

Hittade 2 avhandlingar innehållade orden automaton invariants.

1. 1. Analysis, synthesis and application of automaton-based constraint descriptions

   Författare :María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint predicates; global constraints; automata; automaton-described constraint predicates; automaton-induced constraint decompositions; implied constraints; time-series constraints; transducers; automaton invariants; Computer Science; Datavetenskap;

   Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. LÄS MER

3. 2. Constructive Methods for SAGBI and SAGBI-Gröbner Bases

   Författare :Hans Öfverbeck; Matematik (naturvetenskapliga fakulteten); []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Matematik; Mathematics; elimination; intersection; automata; resultants; noncommutative invariants;

   Sammanfattning : The thesis consists of an introduction and the following four papers: Paper I: Using resultants for SAGBI basis verification in the univariate polynomial ring. Authors: Anna Torstensson, Victor Ufnarovski and Hans Öfverbeck. LÄS MER