Skip to main content

Recognizability equals definability for partial k-paths

Resource type
Thesis
Thesis type
(Thesis) M.Sc.
Date created
1996
Authors/Contributors
Author: Kabanets, Valentine
Copyright statement
Copyright is held by the author.
Permissions
The author has not granted permission for the file to be printed nor for the text to be copied and pasted. If you would like a printable copy of this thesis, please contact summit-permissions@sfu.ca.
Scholarly level
Graduate student (Masters)
Subject
Paths and cycles (Graph theory)
k-spaces.
Trees (Graph theory)
Sequential machine theory.
Language
English
Member of collection
Computing Science Theses
Download file Size
b17944843.pdf 1.74 MB

Views & downloads - as of June 2023

Views: 0
Downloads: 0