Related papers: Unambiguously coded shifts
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…
We give in this paper a logical characterization for unambiguous Context Free Languages, in the vein of descriptive complexity. A fragment of the logic characterizing context free languages given by Lautemann, Schwentick and Th\'erien [18]…
We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.
We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is derived in the cases of single use and multiple uses…
The article reviews different definitions for a convolutional code which can be found in the literature. The algebraic differences between the definitions are worked out in detail. It is shown that bi-infinite support systems are dual to…
An uninterpreted program (UP) is a program whose semantics is defined over the theory of uninterpreted functions. This is a common abstraction used in equivalence checking, compiler optimization, and program verification. While simple, the…
We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…
We introduce a new computable invariant for strong shift equivalence of shifts of finite type. The invariant is based on an invariant introduced by Trow, Boyle, and Marcus, but has the advantage of being readily computable. We summarize…
Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…
Kengo Matsumoto has introduced lambda-graph systems and strong shift equivalence of lambda-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a lambda-graph system. The strong shift equivalence class of the…
Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…
We use the theory of the quantum group $U_q(gl(2,\RR))$ in order to develop a quantum theory of invariants and show a decomposition of invariants into a Gordan-Capelli series. Higher binary forms are introduced on the basis of braided…
The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually…
We define unbounded twisted complexes and bicomplexes generalising the notion of a (bounded) twisted complex over a DG category [BK90]. These need to be considered relative to another DG category $B$ admitting countable direct sums and…
Extrapolating from the two-block system of an example of a nonsofic shift hat was given by Lind and Marcus, a class of one-counter shifts is described, that is disjoint from the class of standard one-counter shifts.
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…
In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…
This paper considers the structure of uncertain linear systems building on concepts of robust unobservability and possible controllability which were introduced in previous papers. The paper presents a new geometric characterization of the…
We consider twisted permutation codes, a class of frequency permutation arrays obtained from finite groups with multiple permutation representations of the same degree, introduced by Gillespie, Praeger and Spiga (and later studied by…