Automates de coût borné sur un alphabet à une lettre
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1985)
- Volume: 19, Issue: 4, page 351-357
- ISSN: 0988-3754
Access Full Article
top
How to cite
topGohon, Philippe. "Automates de coût borné sur un alphabet à une lettre." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.4 (1985): 351-357. <http://eudml.org/doc/92239>.
@article{Gohon1985,
author = {Gohon, Philippe},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {single letter alphabet; cost function; distance function},
language = {fre},
number = {4},
pages = {351-357},
publisher = {EDP-Sciences},
title = {Automates de coût borné sur un alphabet à une lettre},
url = {http://eudml.org/doc/92239},
volume = {19},
year = {1985},
}
TY - JOUR
AU - Gohon, Philippe
TI - Automates de coût borné sur un alphabet à une lettre
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 4
SP - 351
EP - 357
LA - fre
KW - single letter alphabet; cost function; distance function
UR - http://eudml.org/doc/92239
ER -
References
top- 1. S. EILENBERG, Automata, Languages and Machines, Academic Press, Vol. A, 1974. Zbl0317.94045
- 2. K. HASHIGUCHI, Limitedness Theorem on Finite Automata with Distance Functions, J. Comp. Syst Sc., Vol. 24, 1982, p. 233-244. Zbl0513.68051MR661652
- 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. Zbl0353.20055MR446762
- 4. E. SELMER, On the Linear Diophantine Problem of Frobenius, J. reine angew. Math., Vol. 293/294, 1977, p. 1-17. Zbl0349.10009MR441855
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.