|
|
|
|
|
Joachim Niehren and Momar Sakho
We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (????????
NREs
) from the usual XPath benchmark to nested word automata (????????
NWAs
). The determinizatio...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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 - 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
|
|
|
|
|
|
|
|
|
|
The editor of this special issue on “Intelligent Control in Energy Systems” have made an attempt to publish a book containing original technical articles addressing various elements of intelligent control in energy systems. The response to ou...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nicola Prezza
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time proportio...
ver más
|
|
|
|
|
|