Results

A collection of academic publications by faculty and staff, both before and during their time at UPEI.

Use "Limit Results" to narrow your search. Click on an item title to view a full citation, or add the item to your bibliographical list by clicking "Add to My List". Click "Full Text" to download a PDF of the publication where available. UPEI students and employees have the option to "Check at UPEI" for publications that do not have full text available in IslandScholar. To find out more about how to use this page, please read our Help Page.

8226 - 8250 of 8386
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Regular expressions are used in many practical applications. Practical regular expressions are commonly called "regex". 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 ...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Câmpeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007–1018]. We also define an automata s...
[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.]
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.]
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.]
Prostate cancer, one of the most common cancers in the Western world, affects many men worldwide. This study investigated the effects of magnolol, a compound found in the roots and bark of the magnolia tree Magnolia officinalis, on the behavior of 2 androgen insensitive human prostate cancer cell li...
[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.]
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...
[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.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Petri net modeling enables us to verify the protocol of interest formally. However, aside from formal verification, a new protocol really needs to be tested in a relatively realistic environment in which it interworks (or at least co-exists) with earlier or different versions of the same or similar ...
[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 study the shuffle quotient operation and introduce equivalence relations it defines with respect to a (regular) language. Corresponding to an arbitrary shuffle decomposition we construct a normalized decomposition that is defined in terms of maximal languages. Using closure properties of the norm...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this technique seen-is to be the best choice for incrementally building the automaton for a large language, especiall...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]