Related papers: All about unambiguous polynomial closure
We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as…
Unambiguous automata are nondeterministic automata in which every word has at most one accepting run. In this paper we give a polynomial-time algorithm for model checking discrete-time Markov chains against \omega-regular specifications…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We identify a class of smooth Banach *-algebras that are differential subalgebras of commutative C*-algebras whose openness of multiplication is completely determined by the topological stable rank of the target C*-algebra. We then show…
We show that for each Banach ideal of homogeneous polynomials, there exists a (necessarily unique) Banach operator ideal compatible with it. Analogously, we prove that any ideal of $n$-homogeneous polynomials belongs to a coherent sequence…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
The universal object oriented languages made programming more simple and efficient. In the article is considered possibilities of using similar methods in computer algebra. A clear and powerful universal language is useful if particular…
A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform…
We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next…
We characterize all linear operators on finite or infinite-dimensional polynomial spaces that preserve the property of having the zero set inside a prescribed region $\Omega\subseteq \mathbb{C}$ for arbitrary closed circular domains…
We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…
Motivated by work on bio-operations on DNA strings, we consider an outfix-guided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a…
Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…
We classify all uniserial modules of the solvable Lie algebra $\mathfrak{g}=\langle x\rangle \ltimes V$, where $V$ is an abelian Lie algebra over an algebraically closed field of characteristic 0 and $x$ is an arbitrary automorphism of $V$.
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
We will investigate the norm closure of the unitary and similarity orbits of normal operators in unital, simple, purely infinite C*-algebras. An operator theoretic proof will be given to the classification of when two normal operators are…
Given a set U of alternatives, a choice (correspondence) on U is a contractive map c defined on a family Omega of nonempty subsets of U. Semantically, a choice c associates to each menu A in Omega a nonempty subset c(A) of A comprising all…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We show that the commutative closure combined with the iterated shuffle is a regularity-preserving operation on group languages. In particular, for commutative group languages, the iterated shuffle is a regularity-preserving operation. We…