Hromkovic, J. One way multihead deterministic finite automata. (English) Zbl 0504.68049 Acta Inf. 19, 377-384 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 14 Documents MSC: 68Q45 Formal languages and automata Keywords:family of languages recognized by one-way k head deterministic finite state automata; closure properties PDFBibTeX XMLCite \textit{J. Hromkovic}, Acta Inf. 19, 377--384 (1983; Zbl 0504.68049) Full Text: DOI References: [1] Piatkowski, T.F.: N – head finite state machines. Ph.D. Dissertation, University of Michigan, 1963 [2] Rosenberg, A.L.: On multihead finite automata. IBM J.R. and D. 10, 388–394 (1966) · Zbl 0168.01303 · doi:10.1147/rd.105.0388 [3] Rosenberg, A.L.: Nonwriting extensions of finite automata. Ph.D. Dissertation, Harvard University, 1965 [4] Floyd, R.W.: Review 14, 353 of above paper by Rosenberg. Comput. Rev. 9, 280 (1968) [5] Sudborough, I.H.: One-way multihead writing finite automata. Informat. Control 30, 1–20 (1976) · Zbl 0337.02023 · doi:10.1016/S0019-9958(76)90426-5 [6] Yao, A.C., Rivest, R.L.: K + 1 heads are better than K. J. ACM 25, 337–340 (1978) · Zbl 0372.68017 · doi:10.1145/322063.322076 [7] Ibarra, O.H., Kim, C.E.: On 3-head versus 2-head finite automata. Acta Informat. 4, 173–200 (1975) · doi:10.1007/BF00288748 [8] Hromkovič, J.: Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata. Proc. 10th. MFCS, Lecture Notes in Computer Science 118, pp. 304–313. Berlin, Heidelberg, New York: Springer, 1981 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.