Unsolvability levels of operation problems for subclasses of context-free languages
- We investigate the operation problem for linear and deterministic context-free languages: Fix an operation on formal languages. Given linear (deterministic, respectively) context-free languages, is the application of this operation to the given languages still a linear (deterministic, respectively) context-free language? Besides the classical operations, for which the linear and deterministic context-free languages are not closed, we also consider the recently introduced root and power operation. We show non-semidecidability, to be more precise, we show completeness for the second level of the arithmetic hierarchy for all of the aforementioned operations, except for the power operation, if the underlying alphabet contains at least two letters. The result for the power opera, tion solves an open problem stated in Theoret. Comput. Sci. 314 (2004) 445-449
| Author details: | Henning BordihnORCiD, Markus HolzerGND, Martin Kutrib |
|---|---|
| ISSN: | 0129-0541 |
| Publication type: | Article |
| Language: | English |
| Year of first publication: | 2005 |
| Publication year: | 2005 |
| Release date: | 2017/03/24 |
| Source: | International Journal of Foundations of Computer Science. - ISSN 0129-0541. - 16 (2005), 3, S. 423 - 440 |
| Organizational units: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science |
| Peer review: | Referiert |
| Institution name at the time of the publication: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik |
