Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Hi-index | 0.04 |
Using original arguments about sets of integers satisfying some first-order formula of the Presburger arithmetic 〈N,+〉, we give a new proof that the commutative closure of a slip-language over a two letters alphabet is context-free.