• Login
    View Item 
    •   ResearchSpace Home
    • College of Humanities
    • School of Education
    • Mathematics and Computer Science Education
    • Masters Degrees (Mathematics and Computer Science Education)
    • View Item
    •   ResearchSpace Home
    • College of Humanities
    • School of Education
    • Mathematics and Computer Science Education
    • Masters Degrees (Mathematics and Computer Science Education)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Representation of regular formal languages.

    Thumbnail
    View/Open
    Thesis. (1.211Mb)
    Date
    2014
    Author
    Safla, Aslam.
    Metadata
    Show full item record
    Abstract
    This dissertation presents three different approaches to representing Regular Formal languages, i.e., regular expressions, finite acceptors and regular grammars. We define how each method is used to represent the language, and then the method for translating from one representation to another of the language. A toolkit is then presented which allows the user to input their definition of a language using any of the three models, and also allows the user to translate the representation of the language from one model to another.
    URI
    http://hdl.handle.net/10413/10712
    Collections
    • Masters Degrees (Mathematics and Computer Science Education) [90]

    DSpace software copyright © 2002-2013  Duraspace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of ResearchSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsAdvisorsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsAdvisorsType

    My Account

    LoginRegister

    DSpace software copyright © 2002-2013  Duraspace
    Contact Us | Send Feedback
    Theme by 
    @mire NV