Search for dissertations about: "automaton"

Showing result 1 - 5 of 31 swedish dissertations containing the word automaton.

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

    Author : María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
    Keywords : 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;

    Abstract : 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. READ MORE

  4. 2. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search

    Author : Jun He; Pierre Flener; Justin Pearson; Yves Deville; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint programming; regular constraint; automaton constraint; context-free grammar constraint; solution neighbourhood; counter automaton; Datavetenskap; Computer Science;

    Abstract : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. READ MORE

  5. 3. Time-Based Reconstruction of Hyperons at PANDA at FAIR

    Author : Jenny Regina; Karin Schönning; Michael Papenbrock; Pawel Marciniewski; Sophie Grape; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; PANDA; FAIR; hyperons; track reconstruction; online; cellular automaton; 4D tracking; Physics with specialization in Nuclear Physics; Fysik med inriktning mot kärnfysik;

    Abstract : The PANDA (anti-Proton ANnihilation at DArmstadt) experiment at the future FAIR (Facility for Anti-proton and Ion Research) offers unique possibilities for performing hyperon physics.The almost full 4π coverage of the detector will enable the reconstruction of both hyperon and antihyperon which will be created together in proton-antiproton collisions. READ MORE

  6. 4. A study of airborne wear particles from automotive disc brakes

    Author : Jens Wahlström; Ulf Olofsson; Werner Österle; KTH; []
    Keywords : Disc brakes; Airborne wear particles; Nanoparticles; Cellular automaton; Mechanical engineering; Maskinteknik;

    Abstract : During braking, both the disc and pads in disc brakes are worn. Since disc brakes are not sealed,some of the wear particles generated can become airborne. READ MORE

  7. 5. Impartial Games and Recursive Functions

    Author : Urban Larsson; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Algorithmically undecidable; Beatty sequences; Blocking maneuver; Cellular automaton; Comply maneuver; Complementary sequences; Dictionary process; Dual game; Game complexity; Game convergence; Game reflexivity; Heap game; Impartial game; Invariant subtraction game; Move-size dynamic; Nim; P-equivalence; Rule 110; Splitting sequences; *-operator; Subtraction game; Take-away game; Turing complete; Wythoff Nim; Turing complete;

    Abstract : Interest in 2-player impartial games often concerns the famous theory of Sprague-Grundy. In this thesis we study other aspects, bridging some gaps between combinatorial number theory, computer science and combinatorial games. READ MORE