|
|
|
|
|
Chia-Ho Wang, Hsiang-Lin Yu and Tsang-Jung Chang
Currently, for modeling two-dimensional (2D) solute transport during pluvial and fluvial floods, the finite volume (FV) models are widely used because of their strong ability to handle steep concentration and velocity gradients from the flow advection te...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 13 - 19
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrea Calvagna, Emiliano Tramontana and Gabriella Verga
Social network systems are constantly fed with text messages. While this enables rapid communication and global awareness, some messages could be aptly made to hurt or mislead. Automatically identifying meaningful parts of a sentence, such as, e.g., posi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 12 - 20
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 10
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 11
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 8
Quite briefly, the subject of this paper can be formulated as follows: in the previously considered infinite iterative morphism trees, we combine equivalent vertices, in fact, obtaining a deterministic finite automaton; after that, we investigate some pr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Faissal Ouardi, Zineb Lotfi and Bilal Elghadyry
This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression. Allauzen and Mohri have presented a unified construction of small automata and gave a cons...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tatiana Generalova
Pág. 1 - 4
A new formalism for the specification of context-free languages is presented. In this formalism, a generalization of the class of nondeterministic finite automata can be obtained by using an auxiliary alphabet and imposing addit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 5 - 13
Quite briefly, the subject of this paper can be formulated as follows: in the previously considered infinite iterative morphism trees, we combine equivalent states, obtaining in fact a deterministic finite automaton; after that, we in...
ver más
|
|
|
|
|
|