Search results for "Abstract data type"
showing 10 items of 1140 documents
Optimal paths in weighted timed automata
2004
AbstractWe consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n(|δ(A)|+|wmax|)), where n is the number of clock…
Fine and Wilf's Theorem for Three periods and a Generalization of Sturmian Words
1999
AbstractWe extend the theorem of Fine and Wilf to words having three periods. We then define the set 3-PER of words of maximal length for which such result does not apply. We prove that the set 3-PER and the sequences of complexity 2n + 1, introduced by Arnoux and Rauzy to generalize Sturmian words, have the same set of factors.
A fractal set from the binary reflected Gray code
2005
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is shown to be the attractor of a IFS. For large values of $N$ the set is examined from the point of view of time series analysis
Lineability of non-differentiable Pettis primitives
2014
Let \(X\) be an infinite-dimensional Banach space. In 1995, settling a long outstanding problem of Pettis, Dilworth and Girardi constructed an \(X\)-valued Pettis integrable function on \([0,1]\) whose primitive is nowhere weakly differentiable. Using their technique and some new ideas we show that \(\mathbf{ND}\), the set of strongly measurable Pettis integrable functions with nowhere weakly differentiable primitives, is lineable, i.e., there is an infinite dimensional vector space whose nonzero vectors belong to \(\mathbf{ND}\).
A note on the distance set problem in the plane
2001
We use a simple geometric-combinatorial argument to establish a quantitative relation between the generalized Hausdorff measure of a set and its distance set, extending a result originally due to Falconer.
Loop-free Gray code algorithm for the e-restricted growth functions
2011
The subject of Gray codes algorithms for the set partitions of {1,2,...,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of [email protected]?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,...,n}, Ruskey and Savage (1994) [9] generalized [email protected]?s results and give two Gray codes for the set of partitions of {1,2,...,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques. In this paper, we introduce the set of e-restricte…
DEFECT THEOREMS FOR TREES
2000
We generalize different notions of a rank of a set of words to sets of trees. We prove that almost all of those ranks can be used to formulate a defect theorem. However, as we show, the prefix rank forms an exception.
A Newman property for BLD-mappings
2019
We define a Newman property for BLD-mappings and prove that for a BLD-mapping between generalized manifolds equipped with complete path-metrics, this property is equivalent to the branch set being porous when the codomain is LLC. peerReviewed
Generalized ``transition probability''
1975
An operationally meaningful symmetric function defined on pairs of states of an arbitrary physical system is constructed and is shown to coincide with the usual “transition probability” in the special case of systems admitting a quantum-mechanical description. It can be used to define a metric in the set of physical states. Conceivable applications to the analysis of certain aspects of Quantum Mechanics and to its possible modifications are mentioned.
Quantum walks on two-dimensional grids with multiple marked locations
2015
The running time of a quantum walk search algorithm depends on both the structure of the search space (graph) and the configuration (the placement and the number) of marked locations. While the first dependence has been studied in a number of papers, the second dependence remains mostly unstudied.We study search by quantum walks on the two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [3]. The original paper analyses one and two marked locations only. We move beyond two marked locations and study the behaviour of the algorithm for several configurations of multiple marked locations.In this paper, we prove two results showing the importance of how the marked locations ar…