@article{ITA_1993__27_3_261_0,
author = {Cameron, H. A. and Wood, D.},
title = {Pm numbers, ambiguity, and regularity},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {261--275},
year = {1993},
publisher = {EDP Sciences},
volume = {27},
number = {3},
mrnumber = {1227945},
zbl = {0806.11007},
language = {en},
url = {https://www.numdam.org/item/ITA_1993__27_3_261_0/}
}
TY - JOUR AU - Cameron, H. A. AU - Wood, D. TI - Pm numbers, ambiguity, and regularity JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1993 SP - 261 EP - 275 VL - 27 IS - 3 PB - EDP Sciences UR - https://www.numdam.org/item/ITA_1993__27_3_261_0/ LA - en ID - ITA_1993__27_3_261_0 ER -
%0 Journal Article %A Cameron, H. A. %A Wood, D. %T Pm numbers, ambiguity, and regularity %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1993 %P 261-275 %V 27 %N 3 %I EDP Sciences %U https://www.numdam.org/item/ITA_1993__27_3_261_0/ %G en %F ITA_1993__27_3_261_0
Cameron, H. A.; Wood, D. Pm numbers, ambiguity, and regularity. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 3, pp. 261-275. https://www.numdam.org/item/ITA_1993__27_3_261_0/
[ABS89] , and , Sur des points fixes de morphismes d'un monoïde libre, Informatique Théorique et Applications/Theoretical Informatics and Applications, 23, (3), 1989, pp. 235-249. | Zbl | MR | Numdam
[Cam91] , Extremal Cost Binary Trees, Ph. D. thesis, University of Waterloo, 1991.
[CW93] and , The maximal path length of binary trees, Discrete Applied Mathematics, to appear, 1993. | Zbl
[Fra85] , Systems of numeration, The American Mathematical Monthly, 92, (2), 1985, pp. 105-114. | Zbl | MR
[Sha91] , Numeration Systems, linear recurrences, and regular sets, Technical Report CS-91-32, University of Waterloo, July 1991.





