Skip to Main content Skip to Navigation
Conference papers

Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract)

Abstract : We give an answer to a fundamental question, raised by Konstantinidis, Santean, and Yu [Acta Inform. 43 (2007) 395–417], of whether all multi-valued partial CFL functions can be refined by single-valued partial CFL functions. We negatively solve this question by presenting a special multi-valued partial CFL function as an example function and by proving that no refinement of this particular function becomes a single-valued partial CFL function. This contrasts an early result of Kobayashi [Inform. Control 15 (1969) 95–109] that multi-valued partial NFA functions are always refined by single-valued NFA functions. Our example function turns out to be unambiguously 2-valued, and thus we obtain a stronger separation result, in which no refinement of unambiguously 2-valued partial CFL functions can be single-valued. Our proof consists of manipulations and close analyses of underlying one-way one-head nondeterministic pushdown automata equipped with write-only output tapes.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01402038
Contributor : Hal Ifip <>
Submitted on : Thursday, November 24, 2016 - 10:49:47 AM
Last modification on : Thursday, November 24, 2016 - 11:14:11 AM
Long-term archiving on: : Monday, March 20, 2017 - 4:32:26 PM

File

978-3-662-44602-7_12_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Tomoyuki Yamakami. Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract). 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.136-150, ⟨10.1007/978-3-662-44602-7_12⟩. ⟨hal-01402038⟩

Share

Metrics

Record views

88

Files downloads

171