Search results for "Bounded"

showing 10 items of 658 documents

On the computational power of affine automata

2017

We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error.

Discrete mathematicsFOS: Computer and information sciencesComputer scienceFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technologyerror reduction[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesBounded errorPower (physics)Automatonaffine automata[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringnon-classical models of automatacutpoint languages020201 artificial intelligence & image processingTransition matricesAffine transformationcompact setsbounded error
researchProduct

Quadratic rational solvable groups

2012

Abstract A finite group G is quadratic rational if all its irreducible characters are either rational or quadratic. If G is a quadratic rational solvable group, we show that the prime divisors of | G | lie in { 2 , 3 , 5 , 7 , 13 } , and no prime can be removed from this list. More generally, if G is solvable and the field Q ( χ ) generated by the values of χ over Q satisfies | Q ( χ ) : Q | ⩽ k , for all χ ∈ Irr ( G ) , then the set of prime divisors of | G | is bounded in terms of k . Also, we prove that the degree of the field generated by the values of all characters of a semi-rational solvable group (see Chillag and Dolfi, 2010 [1] ) or a quadratic rational solvable group over Q is bou…

Discrete mathematicsFinite groupAlgebra and Number TheoryField (mathematics)Isotropic quadratic formPrime (order theory)CombinatoricsQuadratic equationSolvable groupSolvable groupRational characterBounded functionQuadratic fieldQuadratic fieldMathematicsJournal of Algebra
researchProduct

Finite State Verifiers with Constant Randomness

2012

We give a new characterization of 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 opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.

Discrete mathematicsFinite-state machine010102 general mathematics0102 computer and information sciencesGas meter prover01 natural sciencesRegular language010201 computation theory & mathematicsBounded functionProbabilistic automaton0101 mathematicsConstant (mathematics)Time complexityRandomnessMathematics
researchProduct

Nondeterministic operations on finite relational structures

1998

Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…

Discrete mathematicsFinite-state machineGeneral Computer ScienceComputer scienceLogicFormal languages (recognizable and context-free sets transducers)Unbounded nondeterminismMonad (functional programming)Symbolic computationHypergraphsFirst-order logicLogical theoryDecidabilityTheoretical Computer ScienceNondeterministic algorithmAlgebraDeterministic automatonFormal languageUniversal algebraEquivalence relationTree transducersRewritingComputer Science(all)Theoretical Computer Science
researchProduct

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 .

Discrete mathematicsFredholm theoryProperty (philosophy)Applied MathematicsFredholm operatorBanach spaceExtension (predicate logic)Fredholm theoryBounded operatorLinear mapsymbols.namesakesingle valued extension propertysymbolsAnalysisMathematicsResolventJournal of Mathematical Analysis and Applications
researchProduct

Holomorphic Mappings of Bounded Type on (DF)-Spaces

1992

We study the holomorphic functions of bounded type defined on (DF)-spaces. We prove that they are of uniformly bounded type. The space of all these functions is a Frechet space with its natural topology. Some consequences and related results are obtained.

Discrete mathematicsFréchet spaceBounded functionHolomorphic functionUniform boundednessTotally bounded spaceNatural topologyIdentity theoremBounded typeMathematics
researchProduct

On set-valued cone absolutely summing maps

2009

Spaces of cone absolutely summing maps are generalizations of Bochner spaces Lp(μ, Y), where (Ω, Σ, μ) is some measure space, 1 ≤ p ≤ ∞ and Y is a Banach space. The Hiai-Umegaki space \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) of integrably bounded functions F: Ω → cbf(X), where the latter denotes the set of all convex bounded closed subsets of a separable Banach space X, is a set-valued analogue of L1(μ, X). The aim of this work is to introduce set-valued cone absolutely summing maps as a generalization of \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) , and to derive necessary and sufficient conditions for a set-valued map to be such a set-valued cone absolutely summing map. We …

Discrete mathematicsGeneral MathematicsBanach spaceBochner spaceSpace (mathematics)Measure (mathematics)Separable spaceCombinatoricsBanach lattice Bochner space Cone absolutely summing operator Integrably bounded set-valued function Set-valued operatorNumber theoryCone (topology)Settore MAT/05 - Analisi MatematicaBounded functionMathematicsCentral European Journal of Mathematics
researchProduct

The Bishop–Phelps–Bollobás theorem for L(L1(μ),L∞[0,1])

2011

Abstract We show that the Bishop–Phelps–Bollobas theorem holds for all bounded operators from L 1 ( μ ) into L ∞ [ 0 , 1 ] , where μ is a σ-finite measure.

Discrete mathematicsGeneral MathematicsBounded functionMathematical analysisMeasure (mathematics)MathematicsAdvances in Mathematics
researchProduct

Vector-valued analytic functions of bounded mean oscillation and geometry of Banach spaces

1997

When dealing with vector-valued functions, sometimes is rather difficult to give non trivial examples, meaning examples which do not come from tensoring scalar-valued functions and vectors in the Banach space, belonging to certain classes. This is the situation for vector valued BMO. One of the objectives of this paper is to look for methods to produce such examples. Our main tool will be the vector-valued extension of the following result on multipliers, proved in [MP], which says that the space of multipliers between H and BMOA can be identified with the space of Bloch functions B, i.e. (H, BMOA) = B (see Section 3 for notation), which, in particular gives that g ∗ f ∈ BMOA whenever f ∈ H…

Discrete mathematicsGeneral MathematicsInfinite-dimensional vector functionBanach space46J15Banach manifoldHardy space30G30Bounded mean oscillationBounded operatorsymbols.namesake46B2046E40symbolsInterpolation space46B28Lp spaceMathematics
researchProduct

Convergence of GBS Operators

2018

In [59, 60], Bogel introduced a new concept of Bogel-continuous and Bogel-differentiable functions and also established some important theorems using these concepts. Dobrescu and Matei [80] showed the convergence of the Boolean sum of bivariate generalization of Bernstein polynomials to the B-continuous function on a bounded interval. Subsequently, Badea and Cottin [46] obtained Korovkin theorems for GBS operators.

Discrete mathematicsGeneralizationBounded functionConvergence (routing)Interval (graph theory)Function (mathematics)Bivariate analysisBernstein polynomialMathematics
researchProduct