Results 31 to 40 of about 91,643 (301)

Free Choice in Quantum Theory: A p-adic View

Entropy, 2023
In this paper, it is rigorously proven that since observational data (i.e., numerical values of physical quantities) are rational numbers only due to inevitably nonzero measurements errors, the conclusion about whether Nature at the smallest scales is ...
Vladimir Anashin
doaj   +1 more source

Computational Conversion via Translation Rules for Transforming C++ Code Into UPPAAL’s Automata

IEEE Access, 2017
Formal methods help in quantifying the functional and nonfunctional requirements that are later used in the verification process for safety assurance in real-time systems.
Sidra Sultana, Fahim Arif
doaj   +1 more source

From quantum cellular automata to quantum lattice gases [PDF]

, 1996
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata.
B. Hasslacher, C. Destri, C. S. Lent, D. Deutsch, D. Deutsch, D. Kandel, D. P. DiVincenzo, David A. Meyer, G. Grössing, G. V. Riazanov, H. B. Nielsen, H. Hrgovčić, H. Weyl, I. Bialynicki-Birula Weyl, I. L. Chuang, J. Hardy, K. G. Wilson, K. Morita, L. Bombelli, L. Susskind, M. Hénon, P. Benioff, P. Ruján, P. W. Shor, R. J. Baxter, R. L. Rivest, R. Landauer, R. P. Feynman, S. Fussy, S. Succi, S. Ulam, S. Wolfram, T. Jacobson, T. Toffoli, W. D. Hillis, W. G. Teich, W. G. Teich, W. G. Unruh, Y. L. Luke, Y. Nakawaki   +39 more
core   +3 more sources

MOBILE LEARNING: CONTEXT ADAPTATION AND SCENARIO APPROACH

Открытое образование (Москва), 2016
The paper proposes a model of an open architecture for component context-dependent systems of computer training to the needs of the software applications of intelligent learning environments and adaptive learning systems.
Vladimir V. Kureichik, Sergey I. Rodzin, Lada S. Rodzina   +2 more
doaj   +1 more source

On Determinism and Unambiguity of Weighted Two-way Automata [PDF]

, 2014
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism.
Carnino, Vincent, Lombardy, Sylvain
core   +8 more sources

Universal Hypergraphic Automata Representation by Autonomous Input Symbols

Моделирование и анализ информационных систем, 2018
Hypergraphic automata are automata with state sets and input symbol sets being hypergraphs which are invariant under actions of transition and output functions. Universally attracting objects of a category of hypergraphic automata are automata Atm(H1,H2).
Ekaterina Khvorostukhina, Vladimir Molchanov   +1 more
doaj   +1 more source

Experimental Study of the Shortest Reset Word of Random Automata [PDF]

, 1997
In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental study of the length of the shortest reset word of a finite synchronizing ...
Appelshauser, H., Bachler, J., Bailey, S.J., Barnby, L.S., Bartke, J., Barton, R.A., Bialkowska, H., Blyth, C.O., Bock, R., Bormann, C., Brady, F.P., Brockmann, R., Brun, R., Buncic, P., Caines, H.L., Cebra, D.A., Cooper, G.E., Cramer, J.G., Csato, P., Dunn, J., Eckardt, V., Eckhardt, F., Ferguson, M.I., Fischer, H.G., Flierl, D., Fodor, Z., Foka, P., Freund, P., Friese, V., Fuchs, M., Gabler, F., Gal, J., Gazdzicki, M., Gladysz, E., Grebieszkow, J., Gunther, J., Harris, J.W., Hegyi, S., Henkel, T., Hill, L.A., Huang, I., Hummler, H., Igo, G., Irmscher, D., Jacobs, P., Jones, P.G., Kadija, K., Kolesnikov, V.I., Kowalski, M., Lasiuk, B., Levai, P., Malakhov, A.I., Margetis, S., Markert, C., Melkumov, G.L., Mock, A., Molnar, J., Nelson, John M., Odyniec, G., Oldenburg, M., Palla, G., Panagiotou, A.D., Petridis, A., Piper, A., Porter, R.J., Poskanzer, Arthur M., Poziombka, S., Prindle, D.J., Puhlhofer, F., Rauch, W., Reid, J.G., Renfordt, R., Retyk, W., Ritter, H.G., Rohrich, D., Roland, C., Roland, G., Rudolph, H., Rybicki, A., Sandoval, A., Sann, H., Schafer, E., Schmischke, D., Schmitz, N., Schonfelder, S., Semenov, A.Yu., Seyboth, P., Seyerlein, J., Sikler, F., Skrzypczak, E., Squier, G.T.A., Stock, R., Strobele, H., Szentpetery, I., Sziklai, J., Toy, M., Trainor, T.A., Trentalange, S., Ullrich, T., Vassiliou, M., Vesztergombi, G., Voloshin, S., Vranic, D., Wang, F., Weerasundara, D.D., Wenig, S., Whitten, C., Wienold, T., Wood, L., Yates, T.A., Zimanyi, J., Zybert, R.   +111 more
core   +2 more sources

Theory of Atomata [PDF]

, 2013
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "\'atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or uncomplemented left quotients of ...
Brzozowski, Janusz, Tamm, Hellis
core   +2 more sources

Deterministic automata for extended regular expressions

Open Computer Science, 2017
In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement.
Syzdykov Mirzakhmet
doaj   +1 more source

Reducing Clocks in Timed Automata while Preserving Bisimulation

, 2014
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible.
Arun-Kumar, S., Guha, Shibashis, Narayan, Chinmay   +2 more
core   +1 more source