Loops in automata and HDTOL relations
Culik II, Karel ; Karhumäki, Juhani
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990), p. 327-337 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@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},
     volume = {24},
     year = {1990},
     pages = {327-337},
     mrnumber = {1079718},
     zbl = {0701.68079},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 327-337. http://gdmltest.u-ga.fr/item/ITA_1990__24_4_327_0/

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

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

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

[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 685623 | Zbl 0528.68057

[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 871465 | Zbl 0621.68049

[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 0648.68084

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

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

[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 339558 | Zbl 0235.68029

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

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

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

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

[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 103795 | Zbl 0158.25404

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