Search results for "Regular"
showing 10 items of 855 documents
Il ruolo del white paper sulle offerte al pubblico di cripto-attività alla luce della proposta MiCA
2022
La proposta MiCA, nel regolare il white paper sulle offerte di crypto-assets, sembra tenere in considerazione i benefici e i limiti dei sistemi di voluntary e di mandatory disclosure, non optando integralmente né per il primo, né per il secondo. In quest’ottica, se può condividersi l’approccio regolamentare diretto a graduare, a seconda della tipologia di token offerto, sia il contenuto che l’assoggettamento del documento a mera notifica o ad approvazione ex ante da parte dell’Autorità competente, dubbi sorgono in ordine all’indistinta allocazione dell’onere della prova in capo all’oblato, nei casi di violazione della disciplina del relativo white paper.
On the impact of forgetting on learning machines
1995
People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…
Quantum Computers and Quantum Automata
2000
Quantum computation is a most challenging project involving research both by physicists and computer scientists. The principles of quantum computation differ from the principles of classical computation very much. When quantum computers become available, the public-key cryptography will change radically. It is no exaggeration to assert that building a quantum computer means building a universal code-breaking machine. Quantum finite automata are expected to appear much sooner. They do not generalize deterministic finite automata. Their capabilities are incomparable.
Some models of inductive syntactical synthesis from sample computations
2005
The paper is a survey of several models of inductive program synthesis from sample computations. Synthesis tools are basically syntactical: the synthesis is based on the detection of "regular" fragments related with "shuffled" arithmetical progressions. Input sample computations are supposed to be "representative": they have to "reflect" all loops occurring in the target program. Programs are synthesized in nontraditional form of "generalized" regular expressions having Cleene stars and unions for loops and CASE-like operators. However, if input samples are somehow "annotated" (we consider two different approaches), then loops can be synthesized in more traditional WHILE-form, where loop co…
Conjunction, Disjunction and Iterated Conditioning of Conditional Events
2013
Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the…
Tally languages accepted by Monte Carlo pushdown automata
1997
Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.
On Diving in Trees Thomas Schwentick
2000
The paper is concerned with queries on tree-structured data. It defines fragments of first-order logic (FO) and FO extended by regular expressions along paths. These fragments have the same expressive power as the full logics themselves. On the other hand, they can be evaluated reasonably efficient, even if the formula which represents the query is considered as part of the input.
Convex semi-infinite games
1986
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
1984
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
Spline Algorithms for Deconvolution and Inversion of Heat Equation
2014
In this chapter, we present algorithms based on Tikhonov regularization for solving two related problems: deconvolution and inversion of heat equation. The algorithms, which utilize the SHA technique, provide explicit solutions to the problems in one and two dimensions.