Representation of regular formal languages.
| dc.contributor.advisor | Velinov, Yuri. | |
| dc.contributor.author | Safla, Aslam. | |
| dc.date.accessioned | 2014-05-17T07:45:07Z | |
| dc.date.available | 2014-05-17T07:45:07Z | |
| dc.date.created | 2014 | |
| dc.date.issued | 2014 | |
| dc.description | Thesis (M.Sc.)-University of KwaZulu-Natal, Pitermaritzburg, 2014. | en |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/10413/10712 | |
| dc.language.iso | en_ZA | en |
| dc.subject | Programming languages (Electronic computers) | en |
| dc.subject | Generative grammar. | en |
| dc.subject | Theses--Computer science. | en |
| dc.title | Representation of regular formal languages. | en |
| dc.type | Thesis | en |