Results 271 to 280 of about 12,303 (297)
Some of the next articles are maybe not open access.
A local inversion of a finite automaton by an automaton
Discrete Mathematics and Applications, 1995Summary: We consider the problem of partial reconstruction of an unknown input word of a finite automaton by the output word (a local inversion). For this purpose we use an automaton which calculates the input symbols (a locally inverse automaton). Characteristics of the local inversion are investigated for some classes of automata.
V. V. Yashchenko +2 more
openaire +3 more sources
ACM SIGARCH Computer Architecture News, 2016
Approximate computing is an emerging paradigm enabling tradeoffs between accuracy and efficiency. However, a fundamental challenge persists: state-of-the-art techniques lack the ability to enforce runtime guarantees on accuracy. The convention is to 1) employ offline or online accuracy models, or 2) present experimental results that ...
Joshua San Miguel +1 more
openaire +2 more sources
Approximate computing is an emerging paradigm enabling tradeoffs between accuracy and efficiency. However, a fundamental challenge persists: state-of-the-art techniques lack the ability to enforce runtime guarantees on accuracy. The convention is to 1) employ offline or online accuracy models, or 2) present experimental results that ...
Joshua San Miguel +1 more
openaire +2 more sources
International Journal of Theoretical Physics, 1996
The main contribution of the paper is the investigation of the propositional calculus for automata of Moore or Mealy type. It is shown that the set of the experimentally decidable propositions forms in this case a partition logic, i.e., it can be seen as the ``pasting'' of a family of Boolean algebras.
Martin Schaller, Karl Svozil
openaire +3 more sources
The main contribution of the paper is the investigation of the propositional calculus for automata of Moore or Mealy type. It is shown that the set of the experimentally decidable propositions forms in this case a partition logic, i.e., it can be seen as the ``pasting'' of a family of Boolean algebras.
Martin Schaller, Karl Svozil
openaire +3 more sources
Leonardo, 2012 A recent body of work exploring the uncanny in relation to the automaton has been completed in concurrence with the Doctor of Creative Arts, UWS, 2011. This extract of the doctoral paper details the concepts of inquiry, art works produced, audience response in the form of critical reviews and conclusion.
openaire +1 more source
, 1999 What is in this chapter? Cellular automata are widely used models in mathematical physics and in theoretical biology. These systems start from a random state and then evolve using deterministic rules, with time being discrete. We concentrate on a specific model in this chapter. We define the initial configuration as follows.
openaire +1 more source
Logic Journal of IGPL, 2006
We define an automata-theoretic counterpart of (type-logical) grammars based on the (associative) Lambek-calculusL, a prominent formalism in computational linguistics. While the usual push-down automaton (PDA) has the same weak generative power as the L-based grammars (Pentus, 1995), there is no direct relationship between the computations of a PDA for
Tatyana Veksler, Nissim Francez
openaire +2 more sources
We define an automata-theoretic counterpart of (type-logical) grammars based on the (associative) Lambek-calculusL, a prominent formalism in computational linguistics. While the usual push-down automaton (PDA) has the same weak generative power as the L-based grammars (Pentus, 1995), there is no direct relationship between the computations of a PDA for
Tatyana Veksler, Nissim Francez
openaire +2 more sources
An automaton analogue of unicellularity
Biosystems, 1979There is presented in outline form an abstract model of a cell in an evolutionary context. The design is based on an elaboration of John Holland's one-dimensional, abstract universe recently posed for the study of the emergence of self-replicating systems. Eight new ingredients constitute the elaboration.
openaire +3 more sources
Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture, 2017
Finite State Automata are widely used to accelerate pattern matching in many emerging application domains like DNA sequencing and XML parsing. Conventional CPUs and compute-centric accelerators are bottlenecked by memory bandwidth and irregular memory access patterns in automata processing.
David Blaauw +5 more
openaire +2 more sources
Finite State Automata are widely used to accelerate pattern matching in many emerging application domains like DNA sequencing and XML parsing. Conventional CPUs and compute-centric accelerators are bottlenecked by memory bandwidth and irregular memory access patterns in automata processing.
David Blaauw +5 more
openaire +2 more sources
Automaton models of performance
Journal of Mathematical Psychology, 1973Abstract This work illustrates the use of a stochastic automaton model for describing the temporal steps taken by a student in solving simple arithmetic prolems. The method provides a hierarchial classification of problems by difficulty expressed in terms of the structural features of the problems.
openaire +3 more sources
Acta Astronautica, 1974
Abstract The author confronts the question of whether lunar and planetary exploration and research should be carried out by men or by automatically operated equipment. Soviet and American accomplishments made with automatic devices in the various space programs are reviewed.
openaire +2 more sources
Abstract The author confronts the question of whether lunar and planetary exploration and research should be carried out by men or by automatically operated equipment. Soviet and American accomplishments made with automatic devices in the various space programs are reviewed.
openaire +2 more sources