All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Many-valued R-S memory circuits

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A03150816" target="_blank" >RIV/68407700:21230/08:03150816 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Many-valued R-S memory circuits

  • Original language description

    In this paper we present a many-valued memory circuit based on a generalization of the R-S memory circuit known from the two-valued logical circuits. Based on this many-valued R-S memory circuit we introduce a many-valued level-controlled memory circuitand a many-valued edge-controlled memory circuit of type "master-slave". We discuss problems of the stability of the circuit with respect to small errors of input and output signals as well as to small errors of the gates. We show that the stability canbe preserved by restricting the set of logical values, i.e. the interval [0, 1], to a finite discrete subset of this interval. We find the set of many-valued operations which are suitable for the implementation of the many-valued R-S memory circuit.

  • Czech name

    Many-valued R-S memory circuits

  • Czech description

    In this paper we present a many-valued memory circuit based on a generalization of the R-S memory circuit known from the two-valued logical circuits. Based on this many-valued R-S memory circuit we introduce a many-valued level-controlled memory circuitand a many-valued edge-controlled memory circuit of type "master-slave". We discuss problems of the stability of the circuit with respect to small errors of input and output signals as well as to small errors of the gates. We show that the stability canbe preserved by restricting the set of logical values, i.e. the interval [0, 1], to a finite discrete subset of this interval. We find the set of many-valued operations which are suitable for the implementation of the many-valued R-S memory circuit.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F07%2F1136" target="_blank" >GA201/07/1136: Mathematics of Uncertainty</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2008

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems

  • ISSN

    0218-4885

  • e-ISSN

  • Volume of the periodical

    16

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    SG - SINGAPORE

  • Number of pages

    24

  • Pages from-to

  • UT code for WoS article

    000258301400003

  • EID of the result in the Scopus database