Two-Way Automata and One-Tape Machines: Read Only Versus Linear Time
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00327647" target="_blank" >RIV/68407700:21230/18:00327647 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-319-98654-8_30" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-98654-8_30</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-98654-8_30" target="_blank" >10.1007/978-3-319-98654-8_30</a>
Alternative languages
Result language
angličtina
Original language name
Two-Way Automata and One-Tape Machines: Read Only Versus Linear Time
Original language description
It is well-known that one-tape Turing machines working in linear time are no more powerful than finite automata, namely they recognize exactly the class of regular languages. We study the costs, in terms of description sizes, of the conversion of nondeterministic finite automata into equivalent linear-time one-tape deterministic machines. We prove a polynomial blowup from two-way nondeterministic finite automata into equivalent weight-reducing one-tape deterministic machines that work in linear time. The blowup remains polynomial if the tape in the resulting machines is restricted to the portion which initially contains the input. However, in this case the machines resulting from our construction are not weight reducing, unless the input alphabet is unary.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA16-05872S" target="_blank" >GA16-05872S: Probabilistic Graphical Models and Deep Learning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
International Conference on Developments in Language Theory
ISBN
978-3-319-98653-1
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
366-378
Publisher name
Springer International Publishing
Place of publication
Cham
Event location
Tokyo
Event date
Sep 10, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—