Search results for "termini"
showing 10 items of 365 documents
FINITE AUTOMATA WITH ADVICE TAPES
2014
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, demonstrate an infinite hierarchy of language classes recognized by automata with increasing advice lengths, and establish the relationships between this and the previously studied ways of providing advice to finite automata.
How to simulate free will in a computational device
1999
Since we believe that human brain is not a purely deterministic device merely reacting to the environment but rather it is capable to a free will, Theoretical Computer Science has also tried to develop a system of notions generalizing determinism. Nondeterministic and probabilistic algorithms were the first generalizations. Nondeterministic machines constitute an important part of the Theory of Computation. Nondeterminism is a useful way to describe possible choices. In real life there are many regulations restricting our behavior. These regulations nearly always leave some freedom for us how to react. Such regulations are best described in terms of nondeterministic algorithms. Nondetermini…
Quantum Real - Time Turing Machine
2001
The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can't be recognized by a deterministic real - time Turing machine, is shown.
Space-Efficient 1.5-Way Quantum Turing Machine
2001
1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i ≥ 0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape , and 1.5QTM can recognize it using constant cells quantity.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Finite Automata with Advice Tapes
2013
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, and establish the relationships between this model and the previously studied ways of providing advice to finite automata.
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Termini Imerese. Indagini nell'edificio termale
2018
In this paper, we present the results of archaeological samples conducted in 2010 in the seventeenth-century thermal baths at Termini Imerese. The excavations made it possible to find for the first time some parts of the caldarium of the Roman baths. Some sections of the perimeter wall and the paving of the external ambulatory of the building were identified, as well as a small portion of the narrow internal ambulatory, bordered by a pillared portico that overlooked the circular swimming pool, intended for hot baths, located in the centre of the structure. Some remains of the architectural decoration allow to date the building at the beginning of the first century A.D.
Nanocrystalline ZnCO3—A novel sorbent for low-temperature removal of H2S
2013
Abstract The reactivity of a nanocrystalline ZnCO 3 toward H 2 S (0.2 vol% in N 2 /H 2 mixture) at 140–180 °C was characterized by thermal gravimetric analysis and by breakthrough curves measurements. We have found that under used conditions transformation of ZnCO 3 into ZnS is complete and the rate determining step of the sulfidation is the surface reaction. Such behavior is in strike contrast with that of ZnO whose sulfidation is severely limited by diffusion. The higher reactivity of ZnCO 3 in comparison with ZnO is attributed to the different microstructure of ZnS layer formed in these materials after a partial sulfidation. As in ZnO–ZnS transformation the molar volume increases (from 1…
Terminu atveide tiesas nolēmumos
2022
Maģistra darbā ir veikta tiesas nolēmumu tulkojumu analīze no juridiskās terminoloģijas viedokļa. Maģistra darba mērķis ir analizēt terminu atveidi tiesu nolēmumu tulkojumos un piedāvāt atbilstošus tulkojumus tur, kur tas ir nepieciešams. Maģistra darba mērķa sasniegšanai tika izvirzīti šādi darba uzdevumi – apkopot pieejamos literatūras avotus par terminiem; atlasīt dažādus tiesas nolēmumus un to tulkojumus krievu valodā, lai veiktu terminu atlasi un klasifikāciju pēc nozarēm; veikt terminu un tulkojuma analīzi; izdarīt secinājumus par raksturīgākajām neprecizitātēm tulkojamajā materiālā, par apkopoto informāciju pētījuma darba gaitā. Tiesas nolēmumos lietotā terminoloģija latviešu valodā …