On Language Equations with Invertible Operations

@article{Kari1994OnLE,
  title={On Language Equations with Invertible Operations},
  author={Lila Kari},
  journal={Theor. Comput. Sci.},
  year={1994},
  volume={132},
  pages={129-150}
}
The paper studies language equations of the type X ⋄ L = R and L ⋄ Y = R, where L and R are given languages and ⋄ is an invertible binary word(language) operation. For most of the considered insertion and deletion operations, the existence of both a solution and a singleton solution to these equations proves to be decidable for given regular L and R. In case L is a context-free language and R is a regular one, the existence of a solution is generally undecidable. The results can be extended to… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Generalized Derivatives

Fundam. Inform. • 1993

On insertion and deletion in formal languages

L. Kari.
1990

Semi - Thue systems and generalized ChurchRosser properties

M. Jantzen.
Proc . Fete des Mots • 1986

Erasing strings

R.Book, C M.Jantzen, Wrathall
Lecture Notes in Computer Science, • 1981
View 1 Excerpt

Similar Papers

Loading similar papers…