By Topic

On the Cascade Decomposition of Prefix Automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cutlip, W. F ; Dept. of Mathematics, Michigan State University, East Lansing, Mich.

Perles, Rabin and Shamir conceived prefix automata as realizations of k-definite deterministic automata. The structure theory of deterministic automata as developed by Zeiger reveals that a prefix automaton may be decomposed into a cascade of reset machines.

Published in:

Computers, IEEE Transactions on  (Volume:C-17 ,  Issue: 1 )