Search Constraints

Start Over
Filtering by: Creator Shaw, Wesley D. Remove constraint Creator: Shaw, Wesley D. Advisor Cook, Curtis R. Remove constraint Advisor: Cook, Curtis R.

Search Results

  • Precedence grammars and relation between precedence languages

    Creator:
    Yamagishi, Yoshiyuki
    Abstract:
    Context-free grammars are adequate for specifying the structure of almost all programming languages. But in such specifications, it is difficult and time consuming to analyze a statement in the programming language to recognize its structural components. Precedence grammars, a subset of the context-free grammars, were, developed for quick and easy...
    Resource Type:
    Masters Thesis
    Full Text:
    , Jeffery D. Formal language and their relation to automata. Reading, Massachusetts, Addison- Wesley, 1969

  • A generalization of tree automata and its relation to matrix grammars

    Creator:
    Vomocil, David Leo
    Abstract:
    In this thesis we introduce alpha and beta tree acceptors, generalizations of tree automata. The alpha tree acceptors recognize a tree by final symbol and the beta tree acceptors by final state. We show that alpha and beta tree acceptors recognize the same sets of Gorn trees and demonstrate that...
    Resource Type:
    Masters Thesis
    Full Text:
    the identity of U. Definition 2.1. The depth of a E U is denoted d(a) and is defined by d(0) = 0 and

  • The shortest strings in a context-free language

    Creator:
    Fajuyigbe, Oladele
    Resource Type:
    Masters Thesis
    Full Text:
    . Example: G = (VN, VT, P, S), where V N = {S, A, B} VT = {a, b, d} , and the production rules are S

  • The automated inference of tree system

    Creator:
    Levine, Barry Arthur
    Abstract:
    Tree systems are used in syntactic pattern recognition for describing two-dimensional patterns. We extend results on tree automata with the introduction of the subtree-invariant equivalence relation R. R relates two trees when the appearance of one implies the appearance of the other in similar trees. A new state minimizing algorithm...
    Resource Type:
    Dissertation
    Full Text:
    derivation tree for the string 1 I a b aaabbb in L(G). D: S==>ASB==>aSB==>aSb==,aASBb==>*aaabbb D is a

  • Comparison of several sorting algorithms designed for nearly sorted lists

    Creator:
    Choi, Chung Min
    Abstract:
    Quickersort, Straight Insertion Sort, Mehlhorn's AVL-tree Sorting Algorithm and Cook's new sorting algorithm are compared on nearly and nedium sorted lists. The ratio of the minimum number of list elements that must be removed so that the remaining portion of the list is in order to the size of the...
    Resource Type:
    Capstone Project
    Full Text:
    ....................................... . .... 27 13. b. List Size 13. C. List Size 13. d. List Size 13. e. List Size of 100 of 200 of

  • An iteration algorithm for graph orientation

    Creator:
    Heh, Shiang-Meei
    Resource Type:
    Capstone Project
    Full Text:
    orientation; but it does not give an efficient one. a 0 n a r 0 n " b q p m b C s C I C s d g h k d

  • Minimal perfect hash tables environments

    Creator:
    Pin-Ngern, Ouen
    Abstract:
    Cichelli gave a simple machine independent minimal perfect hashing function for small static sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word. Cichelli's algorithm (word-oriented) to find...
    Resource Type:
    Conference Proceeding
    Full Text:
    -729. Knuth , D. E., The Art of Computer Programming Vol. 3, Addison-Wesley Co., 1973, pp. 506-542

  • A two level minimal perfect hash function for large data sets

    Creator:
    Barrar, Howard
    Abstract:
    Recently several minimal perfect hashing functions far small static word sets have been developed. However, they are limited to sets of 50 words or less. In this paper, a Two Level Minimal Perfect Hash Function for large data sets is given. It partitions a large static set into small sets...
    Resource Type:
    Capstone Project
    Full Text:
    . Step 2 hash es t h e d a ta i n t h e s ma 11 sets. Fig. 1 and 2 present an overview of houi the

  • A study of global variables vs parameter passing

    Creator:
    Matar, Muna
    Abstract:
    Program understanding is a very important part of the testing and maintenance phases of the programming projects. The overall program knowledge, understanding the various parts of the program, and how they communicate are key steps in understanding the program. Hence data communication among modules contributes much to program complexity and...
    Resource Type:
    Capstone Project
    Full Text:
    d l I 11 11 u lJ j J J - 5 - CHAPTER TWO MOTIVATION Program understanding is a very

  • An investigation of the on-line debugging process of expert and novice student programmers

    Creator:
    Nanja, Murthi
    Abstract:
    Debugging, the process of locating and correcting errors in a computer program, is a common programming task that is not well understood. Of the several debugging studies reported in the literature, most compared the performance differences between expert and novice programmers by measuring their debug time and the number of...
    Resource Type:
    Dissertation
    Full Text:
    behavior. (d) the programmers must simultaneously keep track of several aspects of the program's detailed