Search results for "Linear"
showing 10 items of 7165 documents
Local automata and completion
1993
The problem of completing a finite automata preserving its properties is here investigated in the case of deterministic local automata. We show a decision procedure and give an algorithm which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.
Ultrametric Finite Automata and Turing Machines
2013
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
Ultrametric Algorithms and Automata
2015
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Digital calculus: Cellular automata dynamics in closed form
2015
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the composition of functions on finite sets. The expression (and the technique used to obtain it) opens the possibility of gaining mathematical insight in any cellular automaton rule since it constitutes at the same time a simple and fast algorithm to implement any such rule.
Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity
2018
Abstract This paper focuses on multiproduct trading with indivisibilities and where a representative agent may have non-monotonic preferences. In this framework, the set of firms’ profits (which comes from efficient subgame perfect Nash equilibria) is the Pareto frontier of some projection of the core of the game. We show that under monotonicity efficient subgame perfect Nash equilibria are achieved by single offers and the equilibrium characterization is easy to obtain. When dealing with non-monotonic preferences the problem becomes more challenging. Then, we define a pair of primal–dual linear programming problems that fully identifies the core of the game. A set of modified versions of t…
A remark on hyperplane sections of rational normal scrolls
2017
We present algebraic and geometric arguments that give a complete classification of the rational normal scrolls that are hyperplane section of a given rational normal scrolls.
Mean Field Linear Quadratic Games with Set Up Costs
2013
This paper studies linear quadratic games with set up costs monotonic on the number of active players, namely, players whose action is non-null. Such games arise naturally in joint replenishment inventory systems. Building upon a preliminary analysis of the properties of the best response strategies and Nash equilibria for the given game, the main contribution is the study of the same game under large population. We also analyze the influence of an additional disturbance in the spirit of the literature on H∞ control. Numerical illustrations are provided. © 2012 Springer Science+Business Media New York.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
1984
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.