Paper Info
Title
A Note On Off-Line Machines With Brownian Input Heads
Abstract
An off-line machine is a Turing machine with a separate read-only input tape. Such a machine is said to have a ‘Brownian’ input head if it has no control over and cannot observe the moves of the read-only head scanning the input tape. It is shown in this note that the binary languages (i.e., languages over a two-symbol alphabet) recognized by such machines are all regular. The proof is not constructive and relies heavily on the so-called ‘finite sequences theorem’ in the theory of well-partial-ordering.
Year
DOI
Venue
1984
10.1016/0166-218X(84)90091-X
DISCRETE APPLIED MATHEMATICS
Field
DocType
Volume
Discrete mathematics,Algorithm characterizations,Pointer machine,Universal Turing machine,Computer science,Algorithm,Recursive language,Turing machine,Register machine,Turing machine examples,Multitape Turing machine
Journal
9
Issue
ISSN
Citations 
1
0166-218X
1
PageRank 
References 
Authors
0.47
1
1
Name
Order
Citations
PageRank
Keijo Ruohonen115122.20