A Conjecture on Rational Sequences

Dominique Perrin
Additional contact information
Dominique Perrin: Université Paris 7, LITP

A chapter in Sequences, 1990, pp 267-274 from Springer

Abstract: Abstract In this paper, we present a conjecture on the enumerating sequences of rational trees. I have met this problem while working with M.-P. Béal on some problems in coding (see [1] and [2]). At the same time A. Machi and P. Schupp have met the same question in connexion with the study of some presentation of groups. They have realized that a closely related problem had been solved by M. Soittola in the framework of L-systems. I will present below the conjecture and relate it to the work of M. Soittola. I wish to thank M.-P. Béal, A. Machi and P. Schupp without whom this paper would not exist.

Keywords: Rational Tree; Binary Tree; Taylor Series Expansion; Rational Sequence; Empty Word (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_21

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().