Nondeterministic Pushdown Automata with Write-Only Output Tapes and Definable Function Classes (<i>Preliminary Report</i>)

• Item type: SIG Technical Reports(1)
• 公開日: 2012-10-26
• タイトル: Nondeterministic Pushdown Automata with Write-Only Output Tapes and Definable Function Classes (<i>Preliminary Report</i>)
• タイトル / 言語: en
• タイトル: Nondeterministic Pushdown Automata with Write-Only Output Tapes and Definable Function Classes (<i>Preliminary Report</i>)
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Department of Information Science, University of Fukui
• 著者所属(英): en
• 著者所属(英): Department of Information Science, University of Fukui
• 著者名: Tomoyuki, Yamakami
• 著者名(英): Tomoyuki, Yamakami
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: This paper reports preliminary results obtained from a systematic study on the behaviors of multi-valued partial CFL functions, which are computed under various constraints by one-way nondeterministic pushdown automata equipped with additional write-only output tapes. The CFL functions tend to behave quite differently from their corresponding context-free languages. We show several containments and separations among natural classes of CFL functions. We also analyze the computational complexity of languages having properties of selectivity, in which strings (or words) in the languages are selected by appropriate CFL functions. A notion of many-one reducibility introduces relativized CFL functions, which form a hierarchy of CFL function classes. To separate function classes in this hierarchy, we further examine the roles of special oracles that compute multiple values. For a finer analysis, we consider restricted CFL functions having at most k distinct output values and also functions having only values that k CFL functions simultaneously output.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: This paper reports preliminary results obtained from a systematic study on the behaviors of multi-valued partial CFL functions, which are computed under various constraints by one-way nondeterministic pushdown automata equipped with additional write-only output tapes. The CFL functions tend to behave quite differently from their corresponding context-free languages. We show several containments and separations among natural classes of CFL functions. We also analyze the computational complexity of languages having properties of selectivity, in which strings (or words) in the languages are selected by appropriate CFL functions. A notion of many-one reducibility introduces relativized CFL functions, which form a hierarchy of CFL function classes. To separate function classes in this hierarchy, we further examine the roles of special oracles that compute multiple values. For a finer analysis, we consider restricted CFL functions having at most k distinct output values and also functions having only values that k CFL functions simultaneously output.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2012-AL-142, 号 4, p. 1-8, 発行日 2012-10-26
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会