Search results for "Continuous"

A remark on absolutely continuous functions in ℝ n

2006

We introduce the notion ofα, λ-absolute continuity for functions of several variables and we compare it with the Hencl’s definition. We obtain that eachα, λ-absolutely continuous function isn, λ-absolutely continuous in the sense of Hencl and hence is continuous, differentiable almost everywhere and satisfies change of variables results based on a coarea formula and an area formula.

Analytic solution for a class of discrete-time Riccati equations arising in Nash games

1990

Quantum Finite State Automata over Infinite Words

2010

The study of finite state automata working on infinite words was initiated by Buchi [1]. Buchi discovered connection between formulas of the monadic second order logic of infinite sequences (S1S) and ω-regular languages, the class of languages over infinite words accepted by finite state automata. Few years later, Muller proposed an alternative definition of finite automata on infinite words [4]. McNaughton proved that with Muller’s definition, deterministic automata recognize all ω-regular languages [2]. Later, Rabin extended decidability result of Buchi for S1S to the monadic second order of the infinite binary tree (S2S) [5]. Rabin theorem can be used to settle a number of decision probl…

Common fixed points for discontinuous mappings in fuzzy metric spaces

2008

In this paper we prove some common fixed point theorems for fuzzy contraction respect to a mapping, which satisfies a condition of weak compatibility. We deduce also fixed point results for fuzzy contractive mappings in the sense of Gregori and Sapena.

Some Nonlinear Methods in Fréchet Operator Rings and Ψ*-Algebras

1995

Two different inverse function theorems, one of Nash-Moser type, the other due to H. Omori, are extended to obtain special surjectivity results in locally convex and locally pseudo-convex Frechet algebras generated by group actions and derivations. In particular, the following factorization problem is discussed. Let Ψ be a locally pseudo-convex Frechet algebra with unit e and T+ : Ψ Ψ a continuous linear operator. Does there exist a neighborhood U of 0 such that the equation where T- = IΨ- T, has a solution x ∈ Ψ for every y ∈ U?

Factorization of absolutely continuous polynomials

2013

In this paper we study the ideal of dominated (p,s)-continuous polynomials, that extend the nowadays well known ideal of p-dominated polynomials to the more general setting of the interpolated ideals of polynomials. We give the polynomial version of Pietsch s factorization Theorem for this new ideal. Our factorization theorem requires new techniques inspired in the theory of Banach lattices.

A space of projections on the Bergman space

2010

We define a set of projections on the Bergman space A 2 , which is parameterized by an ane subset of a Banach space of holomorphic functions in the disk and which includes the classical Forelli-Rudin projections.

Language Recognition Power and Succinctness of Affine Automata

2016

In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by Diaz-Caro and Yakaryilmaz [6] referred as affine automata. First, we present efficient simulations of probabilistic and quantum automata by means of affine automata which allows us to characterize the class of exclusive stochastic languages. Then, we initiate a study on the succintness of affine automata. In particular, we show that an infinite family of unary regular languages can be recognized by 2-state affine automata, whereas the number of states of any quantum and probabilistic automata cannot be bounded. Finally, we present the characterization …

One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata

2013

We show a family of languages that can be recognized by a family of linear-size alternating one-way finite automata with one alternation but cannot be recognized by any family of polynomial-size bounded-error two-way probabilistic finite automata with the expected runtime bounded by a polynomial. In terms of finite automata complexity theory this means that neither 1Σ2 nor 1Π2 is contained in 2P2.

Hopcroft's algorithm and tree-like automata

2011

Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have running time with the same asymptotic growth rate. In particular, we provide a lower and upper bound for the running time of the algorithm expressed in terms of combinatorial properties of the trees…