Loops in automata and HDTOL relations
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 4, pp. 327-337. 
@article{ITA_1990__24_4_327_0,
     author = {Culik II, Karel and Karhum\"aki, Juhani},
     title = {Loops in automata and {HDTOL} relations},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {327--337},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {4},
     year = {1990},
     mrnumber = {1079718},
     zbl = {0701.68079},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1990__24_4_327_0/}
}
TY  - JOUR
AU  - Culik II, Karel
AU  - Karhumäki, Juhani
TI  - Loops in automata and HDTOL relations
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1990
SP  - 327
EP  - 337
VL  - 24
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1990__24_4_327_0/
LA  - en
ID  - ITA_1990__24_4_327_0
ER  - 
%0 Journal Article
%A Culik II, Karel
%A Karhumäki, Juhani
%T Loops in automata and HDTOL relations
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 327-337
%V 24
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1990__24_4_327_0/
%G en
%F ITA_1990__24_4_327_0
Culik II, Karel; Karhumäki, Juhani. Loops in automata and HDTOL relations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 4, pp. 327-337. http://archive.numdam.org/item/ITA_1990__24_4_327_0/

[1] J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979. | MR | Zbl

[2] M. Bird, The Equivalence Problem for Deterministic two-tape Automata, J. Comput. Sci., Vol. 7, 1973, pp.218-236. | MR | Zbl

[3] K. Culik Ii, A Purely Homomorphic Characterization of Recursively Enumerate Sets, J. Assoc. Comput. Mach., Vol. 6, 1979, pp.345-350. | MR | Zbl

[4] K. Culik Ii and J. Karhumäki, Systems of equations over a free Monoid and Ehrenfeucht's Conjecture, Discrete Math., Vol. 43, 1983, pp. 139-153. | MR | Zbl

[5]K. Culik Ii and J. Karhumäki, The Equivalence of Finite Valued Ttansducers (on HDTOL Languages) is Decidable, Theoret. Comput. Sci., Vol. 47, 1986, pp. 71-84. | MR | Zbl

[6] K. Culik Ii and J. Karhumäki, Systems of Equations Over a Finitely Generated free Monoid Having an Effectively Equivalent Finite Subsystem, Lecture Notes in Mathematics (to appear). | Zbl

[7] K. Culik Ii and J. Karhumäki, HDTOL Matching of Computations of Multiple Automata, Acta Informatica (to appear). | Zbl

[8] S. Ginsburg, The Matematical Theory of Context-Free Languages, McGraw Hill, New York, 1966. | MR | Zbl

[9] S. Ginsburg and E. H. Spanier, AFL with the Semilinear Property, J of Comput. and System Sciences, Vol. 5, 1971, pp. 365-396. | MR | Zbl

[10] M. Harrison, Introduction to Formal Langage Theory, Addison-Wesley, Reading, 1978. | MR | Zbl

[11] E. Kinber, The Inclusion Problem for Some Classes of Deterministic Multitape Automata, Theoret. Comput. Sci., Vol. 26, 1983, pp. 1-24. | MR | Zbl

[12] M. Latteaux, Intersections de languages algébriques bornés Acta Informatica, Vol., 11, 1979, pp. 233-240. | MR | Zbl

[13] H. R. Lewis, A New Decidability Problem with Applications, Proceedings of 18th FOCS Conference, 1979, pp. 62-73. | MR

[14] M. Rabin and D. Scott, Finite Automata and their Decision Problems, I.B.M. J. Res. Develop., Vol. 3, 1959, pp. 114-125. | MR | Zbl

[15] G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980. | MR | Zbl