The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 81 –
100 of
411
The paper deals with some classes of two-dimensional recognizable languages of “high complexity”, in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. For such classes we can solve some open questions related to unambiguity, finite ambiguity and complementation. Then we reformulate a necessary condition for recognizability stated by Matz, introducing a new complexity function. We solve an open question proposed by Matz,...
The paper deals with some classes of two-dimensional recognizable
languages of “high complexity”,
in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and
unambiguous languages.
For such classes we can solve some
open questions related to unambiguity, finite ambiguity
and complementation.
Then we reformulate a necessary condition for recognizability stated by Matz, introducing a new complexity function.
We solve an open question proposed by Matz,...
An interesting topic in the ring theory is the classification of finite rings. Although rings of certain orders have already been classified, a full description of all rings of a given order remains unknown. The purpose of this paper is to classify all finite rings (up to isomorphism) of a given order. In doing so, we introduce a new concept of quasi basis for certain type of modules, which is a useful computational tool for dealing with finite rings. Then, using this concept, we give structure...
We present some novel classification results in quasigroup and loop theory. For quasigroups up to size 5 and loops up to size 7, we describe a unique property which determines the isomorphism (and in the case of loops, the isotopism) class for any example. These invariant properties were generated using a variety of automated techniques --- including machine learning and computer algebra --- which we present here. Moreover, each result has been automatically verified, again using a variety of techniques...
Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious
attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection
based on sequences of system calls. The point is to construct a model that
describes normal or acceptable system activity using the classification trees
approach. The created database is utilized as a basis for distinguishing...
Two deterministic finite automata are almost equivalent if they disagree in acceptance only for finitely many inputs. An automaton A is hyper-minimized if no automaton with fewer states is almost equivalent to A. A regular language L is canonical if the minimal automaton accepting L is hyper-minimized. The asymptotic state complexity s∗(L) of a regular language L is the number of states of a hyper-minimized automaton for a language finitely different from L. In this paper we show that: (1) the class...
Two deterministic finite automata are almost equivalent if they disagree in acceptance
only for finitely many inputs. An automaton A is hyper-minimized if no
automaton with fewer states is almost equivalent to A. A regular language
L is canonical if the minimal automaton accepting L is
hyper-minimized. The asymptotic state complexity
s∗(L) of a regular language
L is the number of states of a hyper-minimized automaton for a language
...
We proceed our work on iterated transductions by
studying the closure under
union and composition of some classes of iterated functions. We
analyze this closure for the classes of length-preserving
rational functions, length-preserving subsequential functions and
length-preserving sequential functions with terminal states.
All the classes we
obtain are equal. We also study the connection with deterministic
context-sensitive languages.
This paper is concerned with the clustering of objects whose properties cannot be described by exact data. These can only be described by fuzzy sets or by linguistic values of previously defined linguistic variables. To cluster these objects we use a generalization of classic clustering methods in which instead of similarity (dissimilarity) of objects, used fuzzy similarity (fuzzy dissimilarity) to define the clustering of fuzzy objects.
Currently displaying 81 –
100 of
411