ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Mechanical Engineering
Pure sciences
Computing
Industrial engineer
Physical
Construction engineering
Computing
Research
all records (70)

Languages
English
German
Spanish
Portuguese

Countries
USA
Indonesia
Brazil
Ukraine
Italy
Australia
Switzerland
Chile
Argelia
Czech Republic
all records (67)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
4.204  Articles
1 of 421 pages  |  10  records  |  more records»
It is inevitable for networks to be invaded during operation. The intrusion tolerance technology comes into being to enable invaded networks to provide the necessary network services. This paper introduces an automatic learning mechanism of the intrusion ... see more

 The object of research is the processes of error-correcting coding in telecommunication and computer systems. The main attention is paid to Reed-Solomon codes, which belong to the very widespread error-correcting codes. Despite the 60-year existence... see more

 The object of research is the processes of error-correcting coding in telecommunication and computer systems. The main attention is paid to Reed-Solomon codes, which belong to the very widespread error-correcting codes. Despite the 60-year existence... see more

The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used. It is usually transformed to the deterministic finite automaton (DFA) that the... see more

In this paper, we continue the topic related to the special binary relation on the set of formal languages (considered primarily on the set of iterations of non­empty finite languages); this is so called equivalence relation at infinity. We have formulate... see more

In the second part of this paper, we continue to consider a special extension of the class of nondeterministic finite automata. We show by examples the following fact: there are regular languages, in the basis automata of which, some vertices do not have ... see more

At present, dynamical systems with chaotic behavior are intensively investigated with different  points of view, and the areas of their application are unusually wide. In particular, ideas of constructing cryptographic systems based on them appe... see more

In this paper, we consider a special extension of the class of non-deterministic finite automata. The purpose of this consideration is the following: first, to describe using such automata various brute-force algorithms of equivalent transformation of aut... see more

The paper is related to the star-height for nondeterministic finite automata, not for the star-height problem for regular languages. We describe an alternative proof of Kleene’s theorem, and then our version of the reduction of some pr... see more

1 of 421 pages  |  10  records  |  more records»