Results

1 - 10 of 24
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
In this paper we study the language of the words that, for a given language L, distinguish between pairs of different left-quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from clo...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Quite often, trivial problems stated for deterministic finite automata (DFA) are surprisingly difficult for the non-deterministic case (NFA). In any non-minimal DFA for a given regular language, we can find two equivalent states which can be “merged” without changing the accepted language. This ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
In this paper we prove a lower bound for the maximum state complexity of Deterministic Finite Cover Automata (DFCAs) obtained from Non-deterministic Finite Automata (NFAs) of a given state complexity n, in case of a binary alphabet. We show, for binary alphabets, that the difference between maximum ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
The nuclear reaction O-18 (d, 2n) F-18 and the separation of F-18 from the irradiated samples have been studied. For this reaction liquid H2O samples were irradiated with deuterons beam in the stainless steel cells cooled with water. The formed positron emiting F-18 was separated from (H2O)-O-18 by ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We introduce a new variant of the heavily studied model of H systems. The new variant will use an external factor to determine the set of the active splicing rules. We improve the best known universality result for time-varying H systems with respect to the diameter of such a system and we prove tha...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata (DFCA) for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal Deterministic Finite Automata (DFA) for the same language L, this technique see...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Regex are used in many programs such as Perl, Awk, Python, egrep, vi, emacs etc. It is known that regex are different from regular expressions. In this paper, we give regex a formal treatment. We make a distinction between regex and extended regex; while regex present regular languages, extended reg...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
In this paper we consider the transformation from (minimal) non-deterministic finite automata (NFAs) to deterministic finite cover automata (DFCAs). We want to compare the two equivalent accepting devices with respect to their number of states; this becomes in fact a comparison between the expressio...