请输入您要查询的百科知识:

 

词条 Log-space transducer
释义

  1. References

A log space transducer (LST) is a type of Turing machine used for log-space reductions.

A log space transducer, , has three tapes:

  • A read-only input tape.
  • A read/write work tape (bounded to at most symbols).
  • A write-only, write-once output tape.

will be designed to compute a log-space computable function (where is the alphabet of both the input and output tapes). If is executed with on its input tape, when the machine halts, it will have remaining on its output tape.

A language is said to be log-space reducible to a language if there exists a log-space computable function, , which will convert an input from problem into an input to problem . I.E. .

This seems like a rather convoluted idea, but it has two useful properties that are desirable for a reduction:

  1. The property of transitivity holds. (A reduces to B and B reduces to C implies A reduces to C).
  2. If A reduces to B, and B is in L, then we know A is in L.

Transitivity holds because it is possible to feed the output tape of one reducer (A→B) to another (B→C). At first glance, this seems incorrect because the A→C reducer needs to store the output tape from the A→B reducer onto the work tape in order to feed it into the B→C reducer, but this is not true. Each time the B→C reducer needs to access its input tape, the A→C reducer can re-run the A→B reducer, and so the output of the A→B reducer never needs to be stored entirely at once.

References

  • Szepietowski, Andrzej (1994), [https://books.google.com/books?id=vNPuNOo9BUYC&pg=PA19&lpg=PA19&dq=log+space+transducer&source=web&ots=zzDCxeVb87&sig=cgzOPS3ZJaIo1kYboPGmvn4jdos&hl=en&sa=X&oi=book_result&resnum=1&ct=result Turing Machines with Sublogarithmic Space ], Springer Press, {{ISBN|3-540-58355-6}}. Retrieved on 2008-12-03.
  • Sipser, Michael (2012), [https://books.google.co.uk/books?id=1aMKAAAAQBAJ Introduction to the Theory of Computation], Cengage Learning, {{ISBN|978-0-619-21764-8}}.
{{comp-sci-theory-stub}}

2 : Computational complexity theory|Turing machine

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/11 17:10:48