Automates de coût borné sur un alphabet à une lettre
Gohon, Philippe
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985), p. 351-357 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1985-01-01
@article{ITA_1985__19_4_351_0,
     author = {Gohon, Philippe},
     title = {Automates de co\^ut born\'e sur un alphabet \`a une lettre},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {19},
     year = {1985},
     pages = {351-357},
     mrnumber = {827482},
     zbl = {0578.68044},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1985__19_4_351_0}
}

Gohon, Philippe. Automates de coût borné sur un alphabet à une lettre. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) pp. 351-357. http://gdmltest.u-ga.fr/item/ITA_1985__19_4_351_0/

1. S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. A, 1974. | Zbl 0317.94045

2. K. Hashiguchi, Limitedness Theorem on Finite Automata with Distance Functions, J. Comp. Syst Sc., Vol. 24, 1982, p. 233-244. | MR 661652 | Zbl 0513.68051

3. G. Markowsky, Bounds on the Index and Period of a Binary Relation on a finite Set, Semigroup Forum, Vol. 13, 1977, p. 253-259. | MR 446762 | Zbl 0353.20055

4. E. Selmer, On the Linear Diophantine Problem of Frobenius, J. reine angew. Math., Vol. 293/294, 1977, p. 1-17. | MR 441855 | Zbl 0349.10009