A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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. ... Acknowledgements Both authors would like to thank Tom Head for his support and inspiration and enthusiasm and encouragement during the first author's thesis research and also during the preparation of ...doi:10.1016/j.dam.2006.10.006 fatcat:pumb7wqvsjfm5gzplaipp6li2e
, 630 syntactic monoids, 52, 142 of prefix codes, 52 syntactic near-rings, 1283 object, 1414 operators. 199 syntactic proof, 2414 system, 1308 syntactic properties. 637, 727 of formulas, 637 ... , 5 18 polynomial-rime, 2676 primitive recursion on trees, 1461 recursion, 1037 simultaneous rigid E-unification, 3295 problem, 3295 simultaneous space-reduction and speed-up, 1083 substitution ...doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Handbook of Natural Computing
The pumping lemma for linear languages can be used to prove that L f (γ) is not linear.Theorem 6.3 (  ) SRSL(f ) Cod(SRSL(f )) CF. ... Moreover, it was shown in [23, 92] that WK-automata recognize some regular languages in a less space-consuming manner. ...doi:10.1007/978-3-540-92910-9_33 fatcat:n3zmhzpj5rgsphmurdophcg234