scientific article; zbMATH DE number 3827237

MaRDI QIDQ3673137zbMATH OpenFDO

Authors Jean Berstel, Christophe Reutenauer

Publication date 1980

zbMATH Keywords

formal tree series

Mathematics Subject Classification ID

Data structures (68P05) Semantics in the theory of computing (68Q55)

Cited in

(9)

• Rational power series, sequential codes and periodicity of sequences
• Construction of a family of finite maximal codes
• Recognizable formal power series on trees
• Rationality of the Möbius function of subword order
• Rational relations and rational series
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• An application of Hajós factorizations to variable-length codes
• Valuations of languages, with applications to fractal geometry
• Completing codes in a sofic shift

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673137)