Representation of regular formal languages.

Representation of regular formal languages.

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...

Full description

Bibliographic Details
Main Author: Safla, Aslam.
Other Authors: Velinov, Yuri.
Language:en_ZA
Published: 2014
Subjects:
Programming languages (Electronic computers)
Generative grammar.
Theses > Computer science.
Online Access:http://hdl.handle.net/10413/10712
id ndltd-netd.ac.za-oai-union.ndltd.org-ukzn-oai-http---researchspace.ukzn.ac.za-10413-10712
record_format oai_dc
spelling ndltd-netd.ac.za-oai-union.ndltd.org-ukzn-oai-http---researchspace.ukzn.ac.za-10413-107122014-05-20T04:02:34ZRepresentation of regular formal languages.Safla, Aslam.Programming languages (Electronic computers)Generative grammar.Theses--Computer science.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.Thesis (M.Sc.)-University of KwaZulu-Natal, Pitermaritzburg, 2014.Velinov, Yuri.2014-05-17T07:45:07Z2014-05-17T07:45:07Z20142014-05-17Thesishttp://hdl.handle.net/10413/10712en_ZA
collection NDLTD
language en_ZA
sources NDLTD
topic Programming languages (Electronic computers)
Generative grammar.
Theses--Computer science.
spellingShingle Programming languages (Electronic computers)
Generative grammar.
Theses--Computer science.
Safla, Aslam.
Representation of regular formal languages.
description 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. === Thesis (M.Sc.)-University of KwaZulu-Natal, Pitermaritzburg, 2014.
author2 Velinov, Yuri.
author_facet Velinov, Yuri.
Safla, Aslam.
author Safla, Aslam.
author_sort Safla, Aslam.
title Representation of regular formal languages.
title_short Representation of regular formal languages.
title_full Representation of regular formal languages.
title_fullStr Representation of regular formal languages.
title_full_unstemmed Representation of regular formal languages.
title_sort representation of regular formal languages.
publishDate 2014
url http://hdl.handle.net/10413/10712
work_keys_str_mv AT saflaaslam representationofregularformallanguages
_version_ 1716667514535018496

Similar Items