1887

n South African Computer Journal - Random generation of unary finite automata over the domain of the regular languages : festschrift : dedicated to Derrick Kourie

USD

 

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 finite automata with a small number of states. We then present a consolidated, practical method for the random generation of unary finite automata over the domain of the regular languages.

Loading

Article metrics loading...

/content/comp/2008/41/EJC28060
2008-12-01
2016-12-03
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error