Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Hardcoding finite automata

Dissertation (MSc (Computer Science))--University of Pretoria, 2003.

Saved in:
Bibliographic Details
Other Authors: Watson, Bruce William
Format: Thesis
Published: University of Pretoria 2013
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613553725276160
access_status_str Open Access
author2 Watson, Bruce William
author_browse Watson, Bruce William
author_facet Watson, Bruce William
collection Thesis
dc_rights_str_mv © 2003 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means,without the prior written permission of the University of Pretoria.
description Dissertation (MSc (Computer Science))--University of Pretoria, 2003.
format Thesis
id oai:repository.up.ac.za:2263/25486
institution University of Pretoria (South Africa)
last_indexed 2026-06-10T12:37:58.997Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository
publishDate 2013
publishDateRange 2013
publishDateSort 2013
publisher University of Pretoria
publisherStr University of Pretoria
record_format dspace
source_str UPSpace — University of Pretoria Institutional Repository
spelling oai:repository.up.ac.za:2263/25486 Hardcoding finite automata Watson, Bruce William upetd@up.ac.za Ngassam, Ernest Ketcha Sequential machine theory Robots Algorithms UCTD Dissertation (MSc (Computer Science))--University of Pretoria, 2003. Please read the abstract in the section 00front of this document Computer Science unrestricted 2013-09-06T21:48:38Z 2005-06-14 2013-09-06T21:48:38Z 2004-04-20 2003 2005-06-13 Dissertation Ngassam EK, 2003, Hardcoding finite automata, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/25486 > H674/th http://hdl.handle.net/2263/25486 http://upetd.up.ac.za/thesis/available/etd-06132005-115153/ © 2003 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means,without the prior written permission of the University of Pretoria. application/pdf application/pdf application/pdf application/pdf University of Pretoria
spellingShingle Sequential machine theory
Robots
Algorithms
UCTD
Hardcoding finite automata
title Hardcoding finite automata
title_full Hardcoding finite automata
title_fullStr Hardcoding finite automata
title_full_unstemmed Hardcoding finite automata
title_short Hardcoding finite automata
title_sort hardcoding finite automata
topic Sequential machine theory
Robots
Algorithms
UCTD
url http://hdl.handle.net/2263/25486
http://upetd.up.ac.za/thesis/available/etd-06132005-115153/