UJDigispace Repository

Automatically presentable structures

Show simple item record

dc.contributor.author Ras, Charl John
dc.date.accessioned 2012-09-03T10:08:07Z
dc.date.available 2012-09-03T10:08:07Z
dc.date.issued 2012-09-03
dc.date.submitted 2003
dc.identifier.uri http://hdl.handle.net/10210/6838
dc.description M.Sc. en_US
dc.description.abstract In this thesis we study some of the propertie of a clas called automatic structures. Automatic structures are structures that can be encoded (in some defined way) into a set of regular languages. This encoding allows one to prove many interesting properties about automatic structures, including decidabilty results. en_US
dc.language.iso en en_US
dc.subject Sequential machine theory en_US
dc.subject Automata en_US
dc.subject Formal languages en_US
dc.subject Equivalence relations (Set theory) en_US
dc.subject Permutation groups en_US
dc.subject Graph theory en_US
dc.subject Numbers, Natural en_US
dc.subject Logic, Symbolic and mathematical en_US
dc.title Automatically presentable structures en_US
dc.type Thesis en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UJDigispace


My Account