報 每日報告新聞網
聖塔非研究所

摘要 To study 量子 computation, it might be helpful to g

2000 · 已發表論文 · 更新 2026/08/30 下午12:48

摘要 To study 量子 computation, it might be helpful to generalize structures from 語言 and automata theory to the 量子 case. To that end, we propose 量子 versions of finite state and push down automat…

SFI 頁面

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

論文資訊

  • 類型：已發表論文
  • 日期：2000

摘要

To study 量子 computation, it might be helpful to generalize structures from 語言 and automata theory to the 量子 case. To that end, we propose 量子 versions of finite-state and push-down automata, and regular and contest-free grammars. We find analogs of several classical theorems, including pumping lemmas, closure properties, rational and algebraic generating functions, and Greibach normal form. We also show that there are 量子 context-free 語言s that are not context-free, so QCFL not equal CFL. (C) 2000 Elsevier Science B.V. All rights reserved.

※ 此為已發表論文，全文需透過期刊付費取得