|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 9
The maximum prefix code is defined in the usual way, ?based on the things stated in the student courses?. An extended maximum prefix code is a finite language containing some maximum prefix code as a subset (proper or improper one). Also the (homo)morphi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 11
In this paper, we return to the topic related to one important binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages), i.e. the equivalence relation at infinity. First of all, we consid...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 11
In this paper, we return to the topic, related to one important binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages), i.e. the equivalence relation at infinity. First of all, we consi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 10
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 nonempty finite languages); this is so called equivalence relation at infinity. We have formulat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 7
The finite and infinite iterations of finite and infinite languages arise in various problems of the formal languages theory.For instance, we can mention their application for the description of subclasses of the context-free languages class with the dec...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 7
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...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 8
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 au...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 9 - 14
In this paper, we considered questions of the possible classification of the states and loops of a nondeterministic finite automaton. For the development of algorithms for equivalent transformation of nondeterministic finite automata, we consider t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 6
In this paper, we considered questions of the possible classification of the states and loops of a nondeterministic finite automaton.For the development of algorithms for equivalent transformation of nondeterministic finite automata, we conside...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 8
In this paper, we introduce a new formalism which is intended for representing a special extensions of finite automata. We call them generalized nondeterministic finite pseudo-automata. This formalism gives not only the equivalence be...
ver más
|
|
|
|
|
|