Results 311 to 320 of about 89,532 (346)
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
Solving Automaton Equations with Distortions in the Automaton Transition Function
Problems of Information Transmission, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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
1965
Pushing forward into space can be accomplished either by manned or by unmanned space vehicles (automata). Space flight in manned vehicles is difficult because of the fact that the human organism can only bear small amounts of acceleration, irradiation and changes of temperature. For automata the corresponding ranges are larger. Further, it is difficult
openaire +2 more sources
Pushing forward into space can be accomplished either by manned or by unmanned space vehicles (automata). Space flight in manned vehicles is difficult because of the fact that the human organism can only bear small amounts of acceleration, irradiation and changes of temperature. For automata the corresponding ranges are larger. Further, it is difficult
openaire +2 more sources