Search results for "construct"

Implications of quantum automata for contextuality

2014

We construct zero error quantum finite automata (QFAs) for promise problems which cannot be solved by bounded error probabilistic finite automata (PFAs). Here is a summary of our results: There is a promise problem solvable by an exact two way QFA in exponential expected time but not by any bounded error sublogarithmic space probabilistic Turing machine (PTM). There is a promise problem solvable by an exact two way QFA in quadratic expected time but not by any bounded error o(loglogn) space PTMs in polynomial expected time. The same problem can be solvable by a one way Las Vegas (or exact two way) QFA with quantum head in linear (expected) time. There is a promise problem solvable by a Las …

Amount of Nonconstructivity in Finite Automata

2009

When D. Hilbert used nonconstructive methods in his famous paper on invariants (1888), P.Gordan tried to prevent the publication of this paper considering these methods as non-mathematical. L. E. J. Brouwer in the early twentieth century initiated intuitionist movement in mathematics. His slogan was "nonconstructive arguments have no value for mathematics". However, P. Erdos got many exciting results in discrete mathematics by nonconstructive methods. It is widely believed that these results either cannot be proved by constructive methods or the proofs would have been prohibitively complicated. R.Freivalds [7] showed that nonconstructive methods in coding theory are related to the notion of…

A Uniform Way to Control Chief Series in Finite p -Groups and to Construct the Countable Algebraically Closed Locally Finite p -Groups

1986

Comparing weak versions of separability

2012

Our aim is to investigate spaces with sigma-discrete and meager dense sets, as well as selective versions of these properties. We construct numerous examples to point out the differences between these classes while answering questions of Tkachuk [30], Hutchinson [17] and the authors of [8].

Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces

2011

We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.

Nondeterministic Moore automata and Brzozowski's minimization algorithm

2012

AbstractMoore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. We propose an algorithm that is a variant of Brzozowski’s minimization algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice. Moreover, we explore more general classes of NMA and analyze the applicability of the algorithm. For some of such classes the algorith…

Automata with Extremal Minimality Conditions

2010

It is well known that the minimality of a deterministic finite automaton (DFA) depends on the set of final states. In this paper we study the minimality of a strongly connected DFA by varying the set of final states. We consider, in particular, some extremal cases. A strongly connected DFA is called uniformly minimal if it is minimal, for any choice of the set of final states. It is called never-minimal if it is not minimal, for any choice of the set of final states. We show that there exists an infinite family of uniformly minimal automata and that there exists an infinite family of never-minimal automata. Some properties of these automata are investigated and, in particular, we consider t…

Nondeterministic Moore Automata and Brzozowski’s Algorithm

2011

Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. In this paper we propose an algorithm that is a variant of Brzozowski's algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice.

On Multiresolution Transforms Based on Weighted-Least Squares

2014

This work is devoted to construct Harten’s multiresolution transforms using Weighted-Least squares for different discretizations. We establish a relation between the filters obtained using some decimation operators. Some properties and examples of filters are presented.

The political attribution of values to Intangible Cultural Heritage: the consuetudinary courts

2021

En el año 2009 la UNESCO incluyó el Tribunal de las Aguas de Valencia y el de Hombres Buenos de Murcia en la Lista Representativa del Patrimonio Cultural Inmaterial de la Humanidad. Ambas instituciones de derecho consuetudinario fueron reconocidas a través de la más elevada categoría de protección inmaterial a nivel internacional. A lo largo de las últimas décadas se han emitido resoluciones consultivas (culturales, jurídicas) y desarrollado una agenda de investigación que suscitan el interés por el análisis de los valores atribuidos o atribuibles a ciertas manifestaciones culturales (materiales o inmateriales) cuya apelación serviría a los actores sociales y políticos para justificar su re…