@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. Informatique th\'eorique}, pages = {351--357}, publisher = {EDP-Sciences}, volume = {19}, number = {4}, year = {1985}, mrnumber = {827482}, zbl = {0578.68044}, language = {fr}, url = {http://www.numdam.org/item/ITA_1985__19_4_351_0/} }
Gohon, Philippe. Automates de coût borné sur un alphabet à une lettre. RAIRO. Informatique théorique, Tome 19 (1985) no. 4, pp. 351-357. http://www.numdam.org/item/ITA_1985__19_4_351_0/
1. Automata, Languages and Machines, Academic Press, Vol. A, 1974. | Zbl
,2. Limitedness Theorem on Finite Automata with Distance Functions, J. Comp. Syst Sc., Vol. 24, 1982, p. 233-244. | MR | Zbl
,3. Bounds on the Index and Period of a Binary Relation on a finite Set, Semigroup Forum, Vol. 13, 1977, p. 253-259. | MR | Zbl
,4. On the Linear Diophantine Problem of Frobenius, J. reine angew. Math., Vol. 293/294, 1977, p. 1-17. | MR | Zbl
,