This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On-the-Fly Algorithms and Sequential Machines
September 2011 (vol. 60 no. 9)
pp. 1372-1375
ASCII Text
x 
 
Nicholas Pippenger, "On-the-Fly Algorithms and Sequential Machines," IEEE Transactions on Computers, vol. 60, no. 9, pp. 1372-1375, September, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TC.2011.35,
author = {Nicholas Pippenger},
title = {On-the-Fly Algorithms and Sequential Machines},
journal ={IEEE Transactions on Computers},
volume = {60},
number = {9},
issn = {0018-9340},
year = {2011},
pages = {1372-1375},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2011.35},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - On-the-Fly Algorithms and Sequential Machines
IS - 9
SN - 0018-9340
SP1372
EP1375
EPD - 1372-1375
A1 - Nicholas Pippenger,
PY - 2011
KW - Finite automata
KW - regular language
KW - reversal.
VL - 60
JA - IEEE Transactions on Computers
ER -
 
Nicholas Pippenger, Harvey Mudd College, Claremont
Frougny has presented a method that generalizes various "on-the-fly” operations that have been presented, mainly in connection with computer arithmetic. First, we shall trace the origin of this method to its source, which is the celebrated paper of Rabin and Scott that introduced the notion of nondeterminism and the power-set construction. Second, we shall show that an understanding of this origin may lead to great quantitative improvements in applications of the method. Finally, we shall show by a pathological example that the method as originally presented by Frougny may result in circuits that are larger, in terms of gates per step, by two exponentiations than those that are constructed as described in the present paper.

[1] S. Eilenberg, Automata, Languages, and Machines. Academic Press, vol. A, 1974.
[2] M.D. Ercegovac and T. Lang, “On-the-Fly Conversion of Redundant into Conventional Representations,” IEEE Trans. Computers, vol. 36, no. 7, pp. 895-897, July 1987.
[3] C. Frougny, “On-the-Fly Algorithms and Sequential Machines,” Proc. IEEE 13th Symp. Computer Arithmetic, pp. 260-265, 1997.
[4] C. Frougny, “On-the-Fly Algorithms and Sequential Machines,” IEEE Trans. Computers, vol. 49, no. 8, pp. 859-863, Aug. 2000.
[5] J. Hopcroft, “An $n\log n$ Algorithm for Minimizing States in a Finite Automaton,” Theory of Machines and Computations, Z. Kohavi and A. Paz, eds., Academic Press, pp. 189-196, 1971.
[6] D.A. Huffman, “The Synthesis of Sequential Switching Circuits,” J. Franklin Inst., vol. 257, pp. 161-190/pp. 275-303, 1954.
[7] P. Kornerup, “Digit-Set Conversions: Generalizations and Applications,” IEEE Trans. Computers, vol. 43, no. 5, pp. 622-629, May 1994.
[8] P. Montuschi and L. Ciminiera, “$n\times n$ Carry-Save Multipliers without Final Addition,” Proc. IEEE 11th Symp. Computer Arithmetic, pp. 54-61, 1993.
[9] M.O. Rabin and D. Scott, “Finite Automata and Their Decision Problems,” IBM J. Research and Development, vol. 3, pp. 114-125, 1959.

Index Terms:
Finite automata, regular language, reversal.
Citation:
Nicholas Pippenger, "On-the-Fly Algorithms and Sequential Machines," IEEE Transactions on Computers, vol. 60, no. 9, pp. 1372-1375, Sept. 2011, doi:10.1109/TC.2011.35
Usage of this product signifies your acceptance of the Terms of Use.