Article ID Journal Published Year Pages File Type
420967 Discrete Applied Mathematics 2007 18 Pages PDF
Abstract

We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular language is a reflexive splicing language, but the general question remains open.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Authors
, ,