A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Synchronized finite automata and 2DFA reductions
1993
Theoretical Computer Science
Ibarra, O.H. and N.Q. Trgn, Synchronized finite automata and 2DFA reductions, Theoretical Computer Science 115 (1993) 261-275. We establish a tight hierarchy of two-way synchronized finite automata with only universal states on the number of allowed processes (Y(ZSUFA(k-proc)) c Y(ZSUFA((k+ 1)-proc))) by studying the reduction functions made by two-way deterministic finite automata with a one-way write-only output tape. As corollaries, we show that, for every k> 1, Y(2SUFA(k-proc)) has a
doi:10.1016/0304-3975(93)90119-e
fatcat:modntx754za6jdaf6hypcngyvu