Search results for "mobile"
showing 10 items of 1399 documents
Do the mobile-rich get richer? Internet use, travelling and social differentiations in Finland
2014
This article investigates the daily travelling practices that are related to mobile-only, fixed-only and combined mobile/fixed use of the Internet, and the social differentiations that are related to these three ways of accessing the Internet. Survey data ( N = 612) collected from Finland in 2011 are analysed. The article shows that mobile-only Internet use is not associated with particularly diverse or frequent daily travelling practices, whereas combined mobile/fixed use is. Mobile-only Internet users are, in fact, in a relatively disadvantaged position – compared with other users, they are more typically unemployed and their household income is lower. The mobility of Internet access as …
Mobile Devices as Tools for Media and Communication Research: A Scoping Review on Collecting Self-report Data in Repeated Measurement Designs
2020
Mobile devices are deeply embedded in people’s everyday lives. On the one hand, this opens up a new field for media and communication research. On the other hand, the widespread diffusion allows fo...
CREAPP K6-12: Tool to evaluate the creative potential of app oriented to the design of personal digital storytelling
2018
An instrument is presented that allows primary school teachers to evaluate the potentiality to develop creativity that have playful online app K6-12 focused on the development of digital storytelling (DST), so they can select those that can be used in the classroom for that purpose. The instrument validated consists of 48 indicators associated with the six dimensions of the creativity: flexibility, originality, fluency, problem solving, elaboration of products and co-edition and dissemination. It was designed based on the opinions of experts in creativity and Information and Communication Technologies of the didactic field, theory of education and methodology; also with the assessments and…
Deterministic generalized automata
1995
A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable.
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.
Quantum Finite Multitape Automata
1999
Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [4], and by A. Kondacs and J. Watrous [3]. This notion is not a generalization of the deterministic finite automata. Moreover, in [3] it was proved that not all regular languages can be recognized by quantum finite automata. A. Ambainis and R. Freivalds [1] proved that for some languages quantum finite automata may be exponentially more concise rather than both deterministic and probabilistic finite automata. In this paper we introduce the notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite automaton but not by deterministic or probabilistic finite automata. This …
Probabilistic Reversible Automata and Quantum Automata
2002
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
Improved constructions of quantum automata
2008
We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use \frac{4}{\epsilon} \log 2p + O(1) states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of \log p than the previously known construction of Ambainis and Freivalds (quant-ph/9802062). Similarly to Ambainis and Freivalds, our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some results in this direction.
Group Input Machine
2009
We introduce a new type of internal memory for finite automata and real-time automata. Instead of using tapes with a prescribed Euclidean structure (one-dimensional or two-dimensional tapes) we allow arbitrary group structure of the internal memory of the automata.