COMPUTATIONAL POWER OF ONE-WAY MULTIHEAD FINITE AUTOMATA
                    Miroslaw Kutylowski
       Institute of Computer Science, University of Wroclaw 


In this paper we sketch our results concerning one-way multihead
finite automata (1-MFA). The full version with complete proofs
can be found in a series of papers ([1],[2],[3],[4]).

[1] Kutylowski M., One-way multihead finite automata 
[2] Kutylowski M., One-way multihead finite automata and 2-bounded languages
[3] Kutylowski M., Remarks on sorting and one-way multihead finite automata
[4] Kutylowski M., Stack versus sensitivity for one-way automata