Search results for "Linear"
showing 10 items of 7165 documents
Deterministic generalized automata
1995
A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable.
The Complexity of Probabilistic versus Quantum Finite Automata
2002
We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - ? for all ? > 0 with O(log2 n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2?(n/log n) states.
Non-constructive Methods for Finite Probabilistic Automata
2007
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.
Absolutely Convergent Extensions of Nonclosable Positive Linear Functionals
2010
The existence of extensions of a positive linear functional ω defined on a dense *-subalgebra \({\mathfrak{A}_0}\) of a topological *-algebra \({\mathfrak{A}}\), satisfying certain regularity conditions, is examined. The main interest is focused on the case where ω is nonclosable and sufficient conditions for the existence of an absolutely convergent extension of ω are given.
The Alternating BWT: an algorithmic perspective
2020
Abstract The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several areas in science and engineering. The Alternating Burrows-Wheeler Transform (ABWT) is another transformation recently introduced in Gessel et al. (2012) [21] and studied in the field of Combinatorics on Words. It is analogous to the BWT, except that it uses an alternating lexicographical order instead of the usual one. Building on results in Giancarlo et al. (2018) [23] , where we have shown that BWT and ABWT are part of a larger class of reversible transformations, …
Counting with Probabilistic and Ultrametric Finite Automata
2014
We investigate the state complexity of probabilistic and ultrametric finite automata for the problem of counting, i.e. recognizing the one-word unary language \(C_n=\left\{ 1^n \right\} \). We also review the known results for other types of automata.
A natural and rigid model of quantum groups
1992
We introduce a natural (Frechet-Hopf) algebra A containing all generic Jimbo algebras U t (sl(2)) (as dense subalgebras). The Hopf structures on A extend (in a continuous way) the Hopf structures of generic U t (sl(2)). The Universal R-matrices converge in A\(\hat \otimes \)A. Using the (topological) dual of A, we recover the formalism of functions of noncommutative arguments. In addition, we show that all these Hopf structures on A are isomorphic (as bialgebras), and rigid in the category of bialgebras.
Operators Which Do Not Have the Single Valued Extension Property
2000
Abstract In this paper we shall consider the relationships between a local version of the single valued extension property of a bounded operator T ∈ L ( X ) on a Banach space X and some quantities associated with T which play an important role in Fredholm theory. In particular, we shall consider some conditions for which T does not have the single valued extension property at a point λ o ∈ C .
POINTS OF $\varepsilon$ -DIFFERENTIABILITY OF LIPSCHITZ FUNCTIONS FROM ${\bb R}^n$ TO ${\bb R}^{n-1}$
2002
This paper proves that for every Lipschitz function $f:{\bb R}^n\longrightarrow {\bb R}^m,\;m < n$ , there exists at least one point of $\varepsilon$ -differentiability of $f$ which is in the union of all $m$ -dimensional affine subspaces of the form $q_0+{\rm span}\{q_1,q_2,\ldots,q_m\},\;{\rm where}\;q_j(j=0,1,\ldots,m)$ are points in ${\bb R}^n$ with rational coordinates.
Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler
1982
This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.