A Note on One-way and Two-way Automata

Thumbnail
View/Open
PERMANENT LINK(S)
http://hdl.handle.net/1813/5901
Collections
Metadata
Show full item record
Author
Hartmanis, Juris
Abstract
The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this difference cannot be exceeded.
Date Issued
1969-09
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR69-43
Type
Technical Report

Statistics