• Login
    Browsing School of Computing Graduate Theses by Author 
    •   Home
    • Scholarly Contributions
    • Computing, School of
    • School of Computing Graduate Theses
    • Browsing School of Computing Graduate Theses by Author
    •   Home
    • Scholarly Contributions
    • Computing, School of
    • School of Computing Graduate Theses
    • Browsing School of Computing Graduate Theses by Author
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browsing School of Computing Graduate Theses by Author "Keeler, Chris"

    • 0-9
    • A
    • B
    • C
    • D
    • E
    • F
    • G
    • H
    • I
    • J
    • K
    • L
    • M
    • N
    • O
    • P
    • Q
    • R
    • S
    • T
    • U
    • V
    • W
    • X
    • Y
    • Z

    Sort by:

    Order:

    Results:

    Now showing items 1-1 of 1

    • title
    • publish date
    • submit date
    • ascending
    • descending
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
      • New metrics for finite automaton complexity and subregular language hierarchies 

        Keeler, Chris
        The degree of ambiguity of nondeterministic finite automata (NFA) has been studied significantly since at least the 1980s. Roughly speaking, the degree of ambiguity counts the number of accepting computations of an ...

        DSpace software copyright © 2002-2015  DuraSpace
        Contact Us
        Theme by 
        Atmire NV
         

         

        Browse

        All of QSpaceCommunities & CollectionsPublished DatesAuthorsTitlesSubjectsTypesThis CollectionPublished DatesAuthorsTitlesSubjectsTypes

        My Account

        LoginRegister

        DSpace software copyright © 2002-2015  DuraSpace
        Contact Us
        Theme by 
        Atmire NV