Show simple item record

dc.contributor Bradford, Phillip G.
dc.contributor Lusth, John C.
dc.contributor Dixon, Brandon
dc.contributor Neggers, Joseph
dc.contributor.advisor Borie, Richard B. Wiegand, Nathan 2017-02-28T22:25:45Z 2017-02-28T22:25:45Z 2010
dc.identifier.other u0015_0000001_0000258
dc.identifier.other Wiegand_alatus_0004D_10311
dc.description Electronic Thesis or Dissertation
dc.description.abstract Labeled graph theory is the marriage of two common problem domains to computer science -- graph theory and automata theory. Though each has been independently studied in depth, there has been little investigation of their intersection, the labeled paths. This dissertation examines three results in the area of labeled path problems. The first result presents an empirical analysis of two context-free labeled all-pairs shortest-path algorithms using MapReduce as the experimental platform. The second and third results examine labeled paths in the context of formal languages beyond the context-free languages. The second result is a lower bound on the length of the longest shortest path when the formal language constraining the path is a member of the control language hierarchy. Finally, the third result presents a labeled all-pairs shortest-path algorithm for each level of the infinite K Linear-Hierarchy.
dc.format.extent 96 p.
dc.format.medium electronic
dc.format.mimetype application/pdf
dc.language English
dc.language.iso en_US
dc.publisher University of Alabama Libraries
dc.relation.ispartof The University of Alabama Electronic Theses and Dissertations
dc.relation.ispartof The University of Alabama Libraries Digital Collections
dc.relation.hasversion born digital
dc.rights All rights reserved by the author unless otherwise indicated.
dc.subject.other Computer Science
dc.title On labeled paths
dc.type thesis
dc.type text University of Alabama. Dept. of Computer Science Computer Science The University of Alabama doctoral Ph.D.

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account