@article{0d1612feeaae4a98836f6fb8b7b42af9,
title = "Autoregressive Equivalents of Rank Order Processors",
abstract = "Any rank order processor (ROP) specified as a positive regular set over the binary alphabet, and any ROP implementable via a stack encoding as input to identical finite state sequential machines, is also implementable in finite autoregressive form with conventional input encoding, provided an internal state vector is properly defined. Any such ROP algorithm can be factored into computations of the median of three values. The theory also shows how ROP{\textquoteright}s may be derived from arbitrarily partially ordered finite sets.",
author = "Butz, {Arthur R.}",
note = "Funding Information: A finite state automaton M = ( S , E. 6. s ~ .F ) where S is a finite set of states, E = { 0, 1 } is the binary input alphabet, 6: S X E + S is the state transition function, and s] is the initial state ( M is in state s, at time 0, and thus in state 6(s,, U ) at time I , where a E E is the input symbol at time 1 ). In the discussion the domain of 6 may be extended to S X E* in the obvious way, where C* is the set of strings of finite length, including the empty string h, that can Manuscript received March 11. 1989; revised August 8, 1989. This work was supported by the National Science Foundation under Grant MIPS- 8822699. The author is with the Department of Electrical Engineering and Com- puter Science. Northwestern University, Evanston, IL 60208. IEEE Log Number 9034985.",
year = "1990",
month = jun,
doi = "10.1109/29.56065",
language = "English (US)",
volume = "38",
pages = "1050--1052",
journal = "IEEE Transactions on Acoustics, Speech, and Signal Processing",
issn = "0096-3518",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",
}