Institutional Repository

Browsing South African Computer Journal (SACJ) by Subject "Nondeterminism"

Browsing South African Computer Journal (SACJ) by Subject "Nondeterminism"

Sort by: Order: Results:

  • The fixpoint theorem in the El-Calculus 
    Postma, SW; McGee, A (South African Institute of Computer Scientists and Information Technologists, 1990)
    The οr.1-calculus is presented as an extension to the standard 1-calculus, and a r.1-term called the strong conditional is discussed. The strong conditional is shown to be non-monotomic, and an extension is made to the ...
  • Some automata-theoretic properties of -NFA 
    Van Zijl, L; Van der Walt, APJ (South African Computer Society (SAICSIT), 1999)
    We prove that the shortest word accepted by an n-state intersection selective nondeterministic automaton with nonempty language can be of length O( e n log n).

Search UnisaIR


Browse

My Account