Results

1 - 9 of 9
[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.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[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.]
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.]
This paper describes work we have done over the past five years in developing e-
learning applications and tools using Semantic Web and Web 2.0 technologies. It does not
provide a comprehensive description of these tools; instead, we focus on the pitfalls we have
encountered and attemp...
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
Finite Deterministic Cover Automata (DFCA) can be obtained from Deterministic Finite Automata (DFA) using the similarity relation-Since the similarity relation is not an equivalence relation, the minimal DFCA for a finite language is usually not unique. We count the number of minimal DFCA that can b...