Some Non-semi-decidability Problems for Linear and Deterministic 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-semi-decidability for all of the aforementioned operations, if the underlying alphabet contains at least two letters. The non-semi-decidability and thus the undecidability for the power operation solves an open problem stated in [4].

[1]  Géraud Sénizergues,et al.  L(A) = L(B) ? decidability results from complete formal systems , 2001 .

[2]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[3]  Derick Wood,et al.  Theory of computation , 1986 .

[4]  Arnaldo Moura,et al.  A Generalization of Ogden's Lemma , 1982, JACM.

[5]  Sheila A. Greibach,et al.  The Undecidability of the Ambiguity Problem for Minimal Linear Grammars , 1963, Inf. Control..

[6]  G. M. Clemence,et al.  Blow up of smooth solutions to the barotropic compressible magnetohydrodynamic equations with finite mass and energy , 2008, 0811.4359.

[7]  Maurice Gross.  Inherent Ambiguity of Minimal Linear Grammars , 1964, Inf. Control..

[8]  Seymour Ginsburg,et al.  Some Recursively Unsolvable Problems in ALGOL-Like Languages , 1963, JACM.

[9]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[10]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[11]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[12]  Derrick Wood,et al.  Theory of Computation: A Primer , 1987 .

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[15]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[16]  Thierry Cachat.  The Power of One-Letter Rational Languages , 2001, Developments in Language Theory.

[17]  Henning Bordihn.  Context-freeness of the power of context-free languages is undecidable , 2004, Theor. Comput. Sci..

[18]  Sheila A. Greibach,et al.  The Unsolvability of the Recognition of Linear Context-Free Languages , 1966, JACM.

[19]  Peter Leupold,et al.  Roots and Powers of Regular Languages , 2002, Developments in Language Theory.