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

dc.contributor.author	Van Zijl, Lynette
dc.contributor.author	Raitt, Lesley
dc.date.accessioned	2009-03-09T12:50:06Z
dc.date.available	2009-03-09T12:50:06Z
dc.date.created	2008-06-05
dc.date.issued	2009-03-09T12:50:06Z
dc.description	The Post-Proceedings of this Festschrift will be formally published in The South African Computer Journal number 41.
dc.description.abstract	We 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.citation	Van 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.uri	http://hdl.handle.net/2263/9191
dc.language.iso	en	en_US
dc.rights	Lynette van Zijl	en_US
dc.subject	Finite Automata	en_US
dc.subject	Random Number Generation	en_US
dc.subject.lcsh	Sequential machine theory
dc.subject.lcsh	Programming languages (Electronic computers)
dc.title	Random Generation of Unary Finite Automata over the Domain of the Regular Languages	en_US
dc.type	Article	en_US