Introduction to matrix analysis (2nd ed.)
Introduction to matrix analysis (2nd ed.)
Automata, Languages, and Machines
Automata, Languages, and Machines
Mathematical Theory of L Systems
Mathematical Theory of L Systems
| Hi-index | 0.00 |
The following problem is shown to be decidable. Given are homomorphisms h1 and h2 from &Sgr;* to &Sgr;* and strings &sgr;1 and &sgr;2 over &Sgr; such that hni(&sgr;i) is a proper prefix of hn+1i (&sgr;i) for i &equil; 1, 2 and all n ≥ 0, i.e. for i &equil; 1, 2, hi generates from &sgr;i an infinite string &agr;i with prefixes hni(&sgr;i) for all n ≥ 0. Test whether &agr;1 &equil; &agr;2. From this result easily follows the decidability of limit language equivalence (&ohgr;-equivalence) for DOL systems.