Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. L. P. Lisovik, “An undecidabie problem for countable Markov chains,” Kibernetika, No. 2, 1–8 (1991).
2. L. P. Lisovik, “Eequivalence of transducers relative to regular languages,” Cybernetics and Systems Analysis, No. 6. 158–159 (1995).
3. S. Ginzburg, The Mathematical Theory of Context-Free Languages [in Russian], Mir, Moscow (1970).
4. P. Turakainen, “On some transducer equivalence problems for families of languages,” Int. J. Comput. Math.,23, No. 2, 99–124 (1988).