Random Generation of Unary Finite Automata over the Domain of the Regular Languages

dc.contributor.authorVan Zijl, Lynette
dc.contributor.authorRaitt, Lesley
dc.contributor.emaillynette@cs.sun.ac.zaen_US
dc.date.accessioned2009-03-09T12:50:06Z
dc.date.available2009-03-09T12:50:06Z
dc.date.created2008-06-05
dc.date.issued2009-03-09T12:50:06Z
dc.descriptionThe Post-Proceedings of this Festschrift will be formally published in The South African Computer Journal number 41.
dc.description.abstractWe show that the standard methods for the random generation of finite automata are inadequate if considered over the domain of the regular languages, for small n. We then present a consolidated, practical method for the random generation of unary finite automata over the domain of the regular languages.
dc.identifier.citationVan Zijl, L & Raitt, L 2008, 'Random Generation of Unary Finite Automata over the Domain of the Regular Languages', in Colloquium and Festschrift at the occasion of the 60th birthday of Derrick Kourie (Computer Science), Windy Brow, South Afica, 28 June 2008. [http://www.cs.up.ac.za/cs/sgruner/Festschrift/]
dc.identifier.urihttp://hdl.handle.net/2263/9191
dc.language.isoenen_US
dc.rightsLynette van Zijlen_US
dc.subjectFinite Automataen_US
dc.subjectRandom Number Generationen_US
dc.subject.lcshSequential machine theory
dc.subject.lcshProgramming languages (Electronic computers)
dc.titleRandom Generation of Unary Finite Automata over the Domain of the Regular Languagesen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Zijl_Random(2008).pdf
Size:
4.67 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.44 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Colloquiums and Festschrifts (At the occasion of the 60th Birthday of Derrick Kourie)
Simple item page