Skip Navigation

The Computer Journal 1977 20(1):63-67; doi:10.1093/comjnl/20.1.63
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wood, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Two variations on n–parallel finite state generators*

D. Wood §

Department of Applied Mathematics, McMaster University, Hamilton, Ontario, UK

Two variations on a basic model, n–parallel finite state generators, are given. One variation causes the model to degenerate, so that only regular sets are generated and the second variation produces new families of languages.

Received March 1973.

* Work carried out under a National Research Council of Canada Grant No. A-7700.

§ Department of Applied Mathematics, McMaster University, Hamilton, Ontario, Canada L8S 4K1


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.