DocumentCode
878735
Title
Easy state tables for compound statement sequence detectors
Author
Fielder, Daniel C. ; Alford, Cecil O.
Author_Institution
Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Volume
35
Issue
3
fYear
1992
fDate
8/1/1992 12:00:00 AM
Firstpage
243
Lastpage
246
Abstract
A very simple divide-and-conquer method for a class of word statements which breaks down a statement to obtain several simple state tables is presented. By following rules for combining the tables, a correct final state table can be constructed. The method has additional bonuses in that what if changes can be explored, and logically impossible word statements can be detected. The method is easy to apply and it provides students with a way of solving difficult problems correctly
Keywords
computer science education; sequential machines; teaching; compound statement sequence detectors; computer science; divide-and-conquer method; education; sequential machines; state tables; students; teaching; word statements; Automata; Detectors; Educational institutions; Hardware; Incentive schemes; Inspection; Logic; Signal synthesis; Speech; Transducers;
fLanguage
English
Journal_Title
Education, IEEE Transactions on
Publisher
ieee
ISSN
0018-9359
Type
jour
DOI
10.1109/13.144654
Filename
144654
Link To Document