FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2107946688> ?p ?o ?g. }

• W2107946688 abstract "This thesis is submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Ph.D) in the FASTAR group of the Department of Computer Science, University of Pretoria, South Africa. I present a number of algorithms for constructing minimal acyclic deterministic finite automata (MADFAs), most of which I originally derived/designed or co-discovered. Being acyclic, such automata represent finite languages and have proven useful in applications such as spellchecking, virus-searching and text indexing. In many of those applications, the automata grow to billions of states, making them difficult to store without using various compression techniques — the most important of which is minimization. Results from the late 1950’s show that minimization yields a unique automaton (for a given language), and later results show that minimization of acyclic automata is possible in time linear in the number of states. These two results make for a rich area of algorithmics research; automata and algorithmics research are relatively old fields of computing science and the discovery/invention of new algorithms in the field is an exciting result. I present both incremental and nonincremental algorithms. With nonincremental techniques, the unminimized acyclic deterministic finite automaton (ADFA) is first constructed and then minimized. As mentioned above, the unminimized ADFA can be very large indeed — often even too large to fit within the virtual memory space of the computer. As a result, incremental techniques for minimization (i.e. the ADFA is minimized during its construction) become interesting. Incremental algorithms frequently have some overhead: if the unminimized ADFA fits easily within physical memory, it may still be faster to use nonincremental techniques. The presentation used in this thesis has a few unusual characteristics: • Few other presentations follow a correctness-by-construction style for presenting and deriving algorithms. The presentations given here include correctness arguments or sketches thereof. • The presentation is taxonomic — emphasizing the similarities and differences between the algorithms at a fundamental level. • While it is possible to present these algorithms in a formal-language-theoretic setting, this thesis remains somewhat closer to the actual implementation issues. • In several chapters, new algorithms and interesting new variants of existing algorithms are presented. • It gives new presentations of many existing algorithms — all in a common format with common examples. • There are extensive links to the existing literature." @default.
• W2107946688 created "2016-06-24" @default.
• W2107946688 creator A5027422026 @default.
• W2107946688 date "2010-01-01" @default.
• W2107946688 modified "2023-09-27" @default.
• W2107946688 title "Constructing minimal acyclic deterministic finite automata" @default.
• W2107946688 cites W112894512 @default.
• W2107946688 cites W1489835744 @default.
• W2107946688 cites W1490430289 @default.
• W2107946688 cites W1491178396 @default.
• W2107946688 cites W1493925387 @default.
• W2107946688 cites W1494055011 @default.
• W2107946688 cites W1496038746 @default.
• W2107946688 cites W1516520611 @default.
• W2107946688 cites W1520996832 @default.
• W2107946688 cites W1526015812 @default.
• W2107946688 cites W1527109760 @default.
• W2107946688 cites W1539488659 @default.
• W2107946688 cites W1549106514 @default.
• W2107946688 cites W1551265161 @default.
• W2107946688 cites W1585070348 @default.
• W2107946688 cites W1660390307 @default.
• W2107946688 cites W1696214505 @default.
• W2107946688 cites W182831726 @default.
• W2107946688 cites W1982268573 @default.
• W2107946688 cites W1989111810 @default.
• W2107946688 cites W1990061958 @default.
• W2107946688 cites W2002089154 @default.
• W2107946688 cites W2008737961 @default.
• W2107946688 cites W2020818475 @default.
• W2107946688 cites W2026551868 @default.
• W2107946688 cites W2030681981 @default.
• W2107946688 cites W2044309072 @default.
• W2107946688 cites W2048895380 @default.
• W2107946688 cites W2049008702 @default.
• W2107946688 cites W2070830131 @default.
• W2107946688 cites W2074468443 @default.
• W2107946688 cites W2074840185 @default.
• W2107946688 cites W2096967468 @default.
• W2107946688 cites W2099747032 @default.
• W2107946688 cites W2102351893 @default.
• W2107946688 cites W2103953153 @default.
• W2107946688 cites W2106583644 @default.
• W2107946688 cites W2108199651 @default.
• W2107946688 cites W2123135686 @default.
• W2107946688 cites W2128791908 @default.
• W2107946688 cites W2137012751 @default.
• W2107946688 cites W2138373802 @default.
• W2107946688 cites W2150229269 @default.
• W2107946688 cites W2152103061 @default.
• W2107946688 cites W2154478838 @default.
• W2107946688 cites W2166871775 @default.
• W2107946688 cites W2176720346 @default.
• W2107946688 cites W2337480916 @default.
• W2107946688 cites W2399371018 @default.
• W2107946688 cites W2400013306 @default.
• W2107946688 cites W2406603794 @default.
• W2107946688 cites W2406803935 @default.
• W2107946688 cites W2611477341 @default.
• W2107946688 cites W2618978198 @default.
• W2107946688 cites W2804775343 @default.
• W2107946688 cites W2890166094 @default.
• W2107946688 hasPublicationYear "2010" @default.
• W2107946688 type Work @default.
• W2107946688 sameAs 2107946688 @default.
• W2107946688 citedByCount "5" @default.
• W2107946688 countsByYear W21079466882012 @default.
• W2107946688 countsByYear W21079466882013 @default.
• W2107946688 countsByYear W21079466882016 @default.
• W2107946688 countsByYear W21079466882017 @default.
• W2107946688 crossrefType "dissertation" @default.
• W2107946688 hasAuthorship W2107946688A5027422026 @default.
• W2107946688 hasConcept C104091681 @default.
• W2107946688 hasConcept C112505250 @default.
• W2107946688 hasConcept C11413529 @default.
• W2107946688 hasConcept C116248031 @default.
• W2107946688 hasConcept C158008952 @default.
• W2107946688 hasConcept C167822520 @default.
• W2107946688 hasConcept C174327141 @default.
• W2107946688 hasConcept C41008148 @default.
• W2107946688 hasConcept C65753522 @default.
• W2107946688 hasConcept C80444323 @default.
• W2107946688 hasConceptScore W2107946688C104091681 @default.
• W2107946688 hasConceptScore W2107946688C112505250 @default.
• W2107946688 hasConceptScore W2107946688C11413529 @default.
• W2107946688 hasConceptScore W2107946688C116248031 @default.
• W2107946688 hasConceptScore W2107946688C158008952 @default.
• W2107946688 hasConceptScore W2107946688C167822520 @default.
• W2107946688 hasConceptScore W2107946688C174327141 @default.
• W2107946688 hasConceptScore W2107946688C41008148 @default.
• W2107946688 hasConceptScore W2107946688C65753522 @default.
• W2107946688 hasConceptScore W2107946688C80444323 @default.
• W2107946688 hasLocation W21079466881 @default.
• W2107946688 hasOpenAccess W2107946688 @default.
• W2107946688 hasPrimaryLocation W21079466881 @default.
• W2107946688 hasRelatedWork W127155157 @default.
• W2107946688 hasRelatedWork W1510921163 @default.
• W2107946688 hasRelatedWork W1537465387 @default.
• W2107946688 hasRelatedWork W1569273857 @default.
• W2107946688 hasRelatedWork W1663309610 @default.

• next