Ensembles libres de chemins dans un graphe

DOI10.24033/bsmf.2051zbMath0616.05043OpenAlexW2502986763MaRDI QIDQ4724661

Christophe Reutenauer

Publication date: 1986

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=BSMF_1986__114__135_0

zbMATH Keywords

variable length codespaths in directed graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (max. 100)

μ-Bicomplete Categories and Parity Games ⋮ Codes and Automata in Minimal Sets ⋮ Zeta Functions of Formal Languages ⋮ Finite biprefix sets of paths in a graph ⋮ Bifix codes and Sturmian words ⋮ Codes and sofic constraints ⋮ Codes, unambiguous automata and sofic systems. ⋮ Completing codes in a sofic shift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the factorization of codes
• Noncommutative factorization of variable-length codes
• Semisimplicity of the algebra associated to a biprefix code
• La transitivite du groupe d'un code biprefixe fini
• On Whitney's 2‐isomorphism theorem for graphs
• Sur certains sous-monoïdes libres

This page was built for publication: Ensembles libres de chemins dans un graphe