Random generation of finite automata over the domain of the regular languages
Thesis (MSc)--University of Stellenbosch, 2007. === ENGLISH ABSTRACT: The random generation of finite automata over the domain of their graph structures is a wellknown problem. However, random generation of finite automata over the domain of the regular languages has not been studied in such detai...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_ZA |
Published: |
Stellenbosch : Stellenbosch University
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10019.1/19646 |