论文信息 - Constructing Sequential Bijections

Constructing Sequential Bijections

We state a simple condition on a rational subset X of a free monoid B* for the existence of a sequential function that is a one-to-one mapping of some free monoid A* onto X. As a by-product we obtain new sequential bijections of a free monoid onto another.

Michel Latteux | Christian Choffrut | Christophe Prieur

[1] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[2] Umberto Eco,et al. Theory of Codes , 1976 .

[3] Christian Choffrut. Bijective Sequential Mappings of a Free Monoid Onto Another , 1994, RAIRO Theor. Informatics Appl..

[4] Robert McNaughton. A decision procedure for generalized sequential mapability-onto of regular sets , 1971, STOC '71.

[5] Jean Berstel,et al. Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[6] Kenneth B. Salomon. The Decidability of a Mapping Problem for Generalized Sequential Machines with Final States , 1975, J. Comput. Syst. Sci..

[7] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[8] Kosaburo Hashiguchi. Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language , 1991, ICALP.